PDE and mathematical physics · Oct 6, 2026
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 of k independent repetitions decays exponentially in k, for . Arbitrary joint finite-dimensional entangled strategies and correlated question distributions are allowed.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model