BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260419T175319Z
UID:Seminar-dept-1289@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20251125T130000
DTEND:20251125T140000
SUMMARY:School Seminar Series
DESCRIPTION:Raimundo Saona Urmeneta: Blind Stochastic Games: From nonexistence, through undecidability, to subclasses\n\nStochastic Games are dynamic games between two opponents with stochastic transitions.\n\nIn the blind model, players observes their actions but not the next state.\n\nA game has a uniform value if each player can approximately guarantee to obtain it in average, for all sufficiently large time horizons.\n\nPrior work has shown that: (1) the uniform value may not exist in general; and (2) it is undecidable to approximate the value in the single-player case (probabilistic automata).\n\nTherefore, we introduce the subclass of ergodic games, restricting the state transitions.\n\nFor ergodic blind stochastic games, we prove the existence of the uniform value and provide an algorithm to approximate it, which is novel even in the single-player setting.\n\nOur results are tight because we show that no algorithm can compute the uniform value of ergodic blind single-player stochastic games. \n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1289
LOCATION:ELEC201, 2th Floor Lecture Theater EEE
END:VEVENT
END:VCALENDAR