BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/602
DTSTAMP:20230914T125931Z
SUMMARY:Two Player Games and Playing Them in Parallel
DESCRIPTION:Speaker: Prahladh  Harsha\n\nAbstract: \nConsider a 2-player ga
 me defined as follows. A referee sends a pair of questions x and y to two 
 players Alice and Bob and accepts if their answers a and b satisfy some pr
 edicate. The 2 players are not allowed to communicate once the game commen
 ces\, however can share some prior randomness\, quantum entanglement etc. 
 We will begin by seeing examples of games in which the players have differ
 ent optimal strategies depending on what they share: randomness\, entangle
 ment\, no-signalling strategies\, etc.\nWe will then consider the parallel
  repetition of games and ask if the players have an advantage over answeri
 ng each of the repetitions independently. Surprisingly\, we will show exam
 ples of games in which the players have an advantage by co-ordinating thei
 r answers across repetitions. Finally\, we will show time permitting\, we 
 will see some applications of parallel repetition to theoretical computer 
 science.\nImage from: Andreas Winter\, "Quantum mechanics: The usefulness 
 of uselessness"\, Nature 466\, 1053–1054\, Aug 2010.\n
URL:https://www.tcs.tifr.res.in/web/events/602
DTSTART;TZID=Asia/Kolkata:20150529T160000
DTEND;TZID=Asia/Kolkata:20150529T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR