BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Parallel Repetition From Fortification
DTSTART:20150116T140000
DTEND:20150116T150000
DTSTAMP:20260507T184926Z
UID:beaa9233480963ed6664d290d21290bae9c76322b5f40e70c2444f78
CATEGORIES:Conferences - Seminars
DESCRIPTION:Dana Moshkovitz\, MIT\nAbstract:\nThe Parallel Repetition Theo
 rem upper-bounds the value of a repeated (tensored) two prover game in ter
 ms of the value of the base game and the number of repetitions.\nIn this w
 ork we give a simple transformation on games -- "fortification" -- and sho
 w that for fortified games\, the value of the repeated game decreases perf
 ectly exponentially with the number of repetitions\, up to an arbitrarily 
 small additive error. Our proof is combinatorial and short.\nAs corollarie
 s\, we obtain simple combinatorial proofs of state-of-the-art PCP Theorems
 .\nShort Bio:\nDana is an assistant professor at the Electrical Engineerin
 g and Computer Science department of MIT and a member of CSAIL. She is a p
 art of the theory of computation group. She has a broad interest in Theor
 etical Computer Science\, with a focus on Probabilistically Checkable Proo
 fs (PCP)\, Pseudo-randomness\, Coding theory and Algorithms.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR