DocumentCode
2833644
Title
Parallel Repetition of Two Prover Games (Invited Survey)
Author
Raz, Ran
Author_Institution
Fac. of Math., Weizmann Inst., Rehovot, Israel
fYear
2010
fDate
9-12 June 2010
Firstpage
3
Lastpage
6
Abstract
The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.
Keywords
game theory; parallel repetition theorem; prover games; theoretical computer science; Application software; Computational complexity; Computer science; Game theory; Mathematics; Physics; Probability distribution; Protocols; Radio access networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity (CCC), 2010 IEEE 25th Annual Conference on
Conference_Location
Cambridge, MA
ISSN
1093-0159
Print_ISBN
978-1-4244-7214-7
Electronic_ISBN
1093-0159
Type
conf
DOI
10.1109/CCC.2010.9
Filename
5497862
Link To Document