Games through Nested Fixpoints

14 years 1 months ago
Games through Nested Fixpoints
In this paper we consider two-player zero-sum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consider total-payoff games which have been introduced as a refinement of mean-payoff games [18, 10]. In the stochastic setting, our class is a turn-based variant of liminf-payoff games [15, 16, 4]. In both settings, we provide a non-trivial characterization of the values through nested fixpoint equations. The characterization of the values of liminf-payoff games moreover shows that solving liminf-payoff games is polynomial-time reducible to solving stochastic parity games. We construct practical algorithms for solving the occurring nested fixpoint equations based on strategy iteration. As a corollary we obtain that solving deterministic total-payoff games and solving stochastic liminf-payoff games is in UP ∩ co−UP.
Thomas Gawlitza, Helmut Seidl
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where CAV
Authors Thomas Gawlitza, Helmut Seidl
Comments (0)