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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication54rd IEEE Conference on Decision and Control,CDC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5845-5850
Number of pages6
ISBN (Electronic)9781479978861
DOIs
Publication statusPublished - 8 Feb 2015
Event54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japan
Duration: 15 Dec 201518 Dec 2015

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference54th IEEE Conference on Decision and Control, CDC 2015
Country/TerritoryJapan
CityOsaka
Period15/12/1518/12/15

Keywords

  • Zero-sum games
  • computational methods
  • directed hypergraphs
  • ergodic control
  • nonlinear consensus
  • risk-sensitive control
  • stochastic control

Fingerprint

Dive into the research topics of 'Hypergraph conditions for the solvability of the ergodic equation for zero-sum games'. Together they form a unique fingerprint.

Cite this