BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1119
DTSTAMP:20230914T125951Z
SUMMARY:Existence of Strategy in Games
DESCRIPTION:Speaker: Prabhat Kumar Jha\n\nAbstract: \nGames are used to mod
 el many instances arising from interaction of more than one computational 
 agent. In program synthesis\, existence of strategy is the key in deciding
  the existence of a program with a given set of specifications.\n\nIn this
  talk\, we will observe Martin's proof of the existence of strategy in a c
 lass of two-player infinite games with perfect information (namely Borel g
 ames). One instance of this result is that in the initial stage of a game 
 of chess\, at least one of the players has a strategy to prevent from losi
 ng.\n\nLink of the paper: https://www.jstor.org/stable/pdf/1971035.pdf?ref
 reqid=excelsior%3Aed93a87cd71602b5a789b6280bf1a5a6\n
URL:https://www.tcs.tifr.res.in/web/events/1119
DTSTART;TZID=Asia/Kolkata:20210226T150000
DTEND;TZID=Asia/Kolkata:20210226T160000
END:VEVENT
END:VCALENDAR