BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260911T021945Z
UID:Seminar-dept-405@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20160412T130000
DTEND:20160412T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Elias Tsigaridas: Algorithms for stochastic games and polynomial system solving\n\nShapley's discounted stochastic games and Everett's recursive games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We present an exact algorithm for solving such games based on separation bounds from real algebraic geometry. When the number of positions of the game is constant, the algorithm runs in polynomial time and is the first with this property. If time permits, we will also present lower bounds on the algebraic degree of the values of stochastic games, induced from the irreducibility of polynomials that have coefficients that depend on the combinatorial parameters of the games, based on a generalization of Eisenstein criterion.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=405
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR