Threshold repetition for entangled games

Proves exponential threshold repetition for every finite two-player one-round game: if its entangled value is v < 1, the probability of winning at least a fraction $v+\delta$ of k independent repetitions decays exponentially in k, for $0\lt \delta\lt 1-v$. Arbitrary joint finite-dimensional entangled strategies and correlated question distributions are allowed.