ECCC-Report TR14-095https://eccc.weizmann.ac.il/report/2014/095Comments and Revisions published for TR14-095en-usWed, 08 Apr 2015 00:58:27 +0300
Revision 1
| Small value parallel repetition for general games |
Mark Braverman,
Ankit Garg
https://eccc.weizmann.ac.il/report/2014/095#revision1We prove a parallel repetition theorem for general games with value tending to 0. Previously Dinur and Steurer proved such a theorem for the special case of projection games. We use information theoretic techniques in our proof. Our proofs also extend to the high value regime (value close to 1) and provide alternate proofs for the parallel repetition theorems of Holenstein and Rao for general and projection games respectively. We also extend the example of Feige and Verbitsky to show that the small-value parallel repetition bound we obtain is tight. Our techniques are elementary in that we only need to employ basic information theory and discrete probability in the small-value parallel repetition proof.Wed, 08 Apr 2015 00:58:27 +0300https://eccc.weizmann.ac.il/report/2014/095#revision1
Paper TR14-095
| Small value parallel repetition for general games |
Mark Braverman,
Ankit Garg
https://eccc.weizmann.ac.il/report/2014/095We prove a parallel repetition theorem for general games with value tending to 0. Previously Dinur and Steurer proved such a theorem for the special case of projection games. We use information theoretic techniques in our proof. Our proofs also extend to the high value regime (value close to 1) and provide alternate proofs for the parallel repetition theorems of Holenstein and Rao for general and projection games respectively. We also extend the example of Feige and Verbitsky to show that the small-value parallel repetition bound we obtain is tight. Our techniques are elementary in that we only need to employ basic information theory and discrete probability in the small-value parallel repetition proof.Thu, 24 Jul 2014 21:49:55 +0300https://eccc.weizmann.ac.il/report/2014/095