Passer à la navigation principale Passer à la recherche Passer au contenu principal

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

  • Ecole polytechnique

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

2 Citations (Scopus)

Résumé

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.

langue originaleAnglais
titre54rd IEEE Conference on Decision and Control,CDC 2015
EditeurInstitute of Electrical and Electronics Engineers Inc.
Pages5845-5850
Nombre de pages6
ISBN (Electronique)9781479978861
Les DOIs
étatPublié - 8 févr. 2015
Evénement54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japon
Durée: 15 déc. 2015 → 18 déc. 2015

Série de publications

NomProceedings of the IEEE Conference on Decision and Control
ISSN (imprimé)0743-1546
ISSN (Electronique)2576-2370

Une conférence

Une conférence54th IEEE Conference on Decision and Control, CDC 2015
Pays/TerritoireJapon
La villeOsaka
période15/12/15 → 18/12/15

Empreinte digitale

Examiner les sujets de recherche de « Hypergraph conditions for the solvability of the ergodic equation for zero-sum games ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation