Skip to Main content Skip to Navigation
Documents associated with scientific events

Policy iteration for stochastic zero-sum games

Marianne Akian 1, 2
2 MAXPLUS - Max-plus algebras and mathematics of decision
CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France
Abstract : Recent results of Ye and Hansen, Miltersen and Zwick show that policy iteration for one or two player (perfect information) zero-sum stochastic games, restricted to instances with a fixed discount rate, is strongly polynomial. We show that policy iteration for mean-payoff zero-sum stochastic games is also strongly polynomial when restricted to instances with bounded first mean return time to a given state. The proof is based on methods of nonlinear Perron-Frobenius theory, allowing us to reduce the mean-payoff problem to a discounted problem with state dependent discount rate. Our analysis also shows that policy iteration remains strongly polynomial for discounted problems in which the discount rate can be state dependent (and even negative) at certain states, provided that the spectral radii of the nonnegative matrices associated to all strategies are bounded from above by a fixed constant strictly less than 1.
Document type :
Documents associated with scientific events
Complete list of metadata

https://hal.inria.fr/hal-01024097
Contributor : Estelle Bouzat <>
Submitted on : Tuesday, July 15, 2014 - 4:07:24 PM
Last modification on : Thursday, March 5, 2020 - 6:30:31 PM
Long-term archiving on: : Friday, November 21, 2014 - 6:50:38 PM

File

Akian-NETCO2014.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01024097, version 1

Citation

Marianne Akian. Policy iteration for stochastic zero-sum games. NETCO 2014, 2014, Tours, France. ⟨hal-01024097⟩

Share

Metrics

Record views

592

Files downloads

84