Group:Algorithms, Complexity and Cryptography Group
Title: Exact algorithms for stochastic games and real algebraic geometry
Speaker: Elias Tsigaridas University
Time: 2011-11-04 14:00-2011-11-04 15:30
Venue: FIT 1-222

Abstract:

Shapley'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 irreducibility of polynomials with coefficients that depend on the combinatorial parameters of the games, based on a generalization of Eisenstein criterion.

Joint work with K.A. Hansen, M. Koucky, N. Lauritzen, and P.B. Miltersen.