BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1180
DTSTAMP:20230914T125953Z
SUMMARY:Stochastic window mean-payoff games
DESCRIPTION:Speaker: Pranshu Gaba\n\nAbstract: \nWe consider two-player sto
 chastic games on a graph. Two-player stochastic games are a generalization
  of  two-player games and Markov decision processes. Each state in the gr
 aph is controlled by one of the two players P1 and P2. The game begins by 
 placing a token on the initial state. In each turn\, the player controllin
 g the state of the token chooses an action\, which then returns a probabil
 ity distribution over the out-edges from the state. An out-edge is chosen 
 according to this distribution\, the token is moved along this edge to a n
 ew state\, and the turn ends. The game then starts from the new state\, an
 d the player who controls this new state chooses an action available from 
 that state.\nThis continues ad infinitum.\nIn this work\, we consider wind
 ow mean-payoff objective. Each edge has a rational payoff. The sequence of
  edges chosen in a play corresponds to a sequence of payoffs. Given an int
 eger l\, and a threshold \\lambda\, the objective of player P1 is to ensur
 e that from every state in a play\, for some interval window of length at 
 most l\, the mean of the payoffs in the window is at least \\lambda. The o
 bjective of player P2 is the complement of P1's objective. Window mean-pay
 off objectives have been studied for two-player games and for Markov decis
 ion processes earlier. We study here two-player stochastic games with wind
 ow objectives.\n\nZoom Meeting link:\nhttps://zoom.us/j/96361358353?pwd=U2
 92aStIb3h5M1FIUTZWYThaL2dDdz09\nMeeting ID: 963 6135 8353\nPasscode: 70301
 4\n
URL:https://www.tcs.tifr.res.in/web/events/1180
DTSTART;TZID=Asia/Kolkata:20220118T110000
DTEND;TZID=Asia/Kolkata:20220118T120000
LOCATION:Via Zoom
END:VEVENT
END:VCALENDAR