The Complexity of Ergodic Mean-payoff Games

DOI10.1007/978-3-662-43951-7_11zbMath1410.68156arXiv1404.5734OpenAlexW117892472MaRDI QIDQ5167832

Rasmus Ibsen-Jensen, Krishnendu Chatterjee

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5734

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

A potential reduction algorithm for two-person zero-sum mean payoff stochastic games ⋮ Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ Strategy recovery for stochastic mean payoff games ⋮ Unnamed Item

This page was built for publication: The Complexity of Ergodic Mean-payoff Games