# Hypergraph conditions for the solvability of the ergodic equation for zero-sum games

1 MAXPLUS - Max-plus algebras and mathematics of decision
CMAP - Centre de Mathématiques Appliquées - Ecole Polytechnique, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : The ergodic equation is a basic tool in the study of mean-payoff stochastic games. Its solvability entails that the mean payoff is independent of the initial state. Moreover, optimal stationary strategies are readily obtained from its solution. In this paper, we give a general sufficient condition for the solvability of the ergodic equation, for a game with finite state space but arbitrary action spaces. This condition involves a pair of directed hypergraphs depending only on the growth at infinity'' of the Shapley operator of the game. This refines a recent result of the authors which only applied to games with bounded payments, as well as earlier nonlinear fixed point results for order preserving maps, involving graph conditions.
Type de document :
Communication dans un congrès
54th IEEE Conference on Decision and Control (CDC 2015), Dec 2015, Osaka, Japan. 2015, Proceedings of the 54th IEEE Annual Conference on Decision and Control (CDC), Osaka, 2015. 〈http://www.cdc2015.ctrl.titech.ac.jp/〉

https://hal.inria.fr/hal-01249321
Contributeur : Stephane Gaubert <>
Soumis le : jeudi 31 décembre 2015 - 15:26:01
Dernière modification le : jeudi 10 mai 2018 - 02:05:08

### Identifiants

• HAL Id : hal-01249321, version 1
• ARXIV : 1510.05396

### Citation

Marianne Akian, Stephane Gaubert, Antoine Hochart. Hypergraph conditions for the solvability of the ergodic equation for zero-sum games. 54th IEEE Conference on Decision and Control (CDC 2015), Dec 2015, Osaka, Japan. 2015, Proceedings of the 54th IEEE Annual Conference on Decision and Control (CDC), Osaka, 2015. 〈http://www.cdc2015.ctrl.titech.ac.jp/〉. 〈hal-01249321〉

### Métriques

Consultations de la notice