On canonical forms for zero-sum stochastic mean payoff games
From MaRDI portal
Publication:367425
DOI10.1007/s13235-013-0075-xzbMath1304.91028OpenAlexW2068038501MaRDI QIDQ367425
Kazuhisa Makino, Endre Boros, Khaled M. Elbassioni, Vladimir A. Gurvich
Publication date: 16 September 2013
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-013-0075-x
Related Items (9)
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ A note on the approximation of mean-payoff games ⋮ On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ A nested family of \(k\)-total effective rewards for positional games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- On canonical forms for zero-sum stochastic mean payoff games
- On stochastic games with additive reward and transition structure
- Stochastic games with additive transitions
- Reduction of stochastic parity to stochastic mean-payoff games
- An orderfield property for stochastic games when one player controls transition probabilities
- Ordered field property for stochastic games when the player who controls transitions changes from state to state
- Positional strategies for mean payoff games
- The complexity of stochastic games
- Extensions of two person zero sum games
- A characterization of the minimum cycle mean in a digraph
- Some comments on a theorem of Hardy and Littlewood
- The complexity of mean payoff games on graphs
- Orderfield property of mixtures of stochastic games
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Mean Cost Cyclical Games
- A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games
- Maximum-Minimum Sätze über Graphen
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
- A deterministic subexponential algorithm for solving parity games
- The Complexity of Solving Stochastic Games on Graphs
- Successive Approximation Methods in Undiscounted Stochastic Games
- On Stochastic Games with Stationary Optimal Strategies
- Discrete Dynamic Programming
- On Nonterminating Stochastic Games
- Stochastic Games with Perfect Information and Time Average Payoff
- Stochastic Games
- Stochastic games
This page was built for publication: On canonical forms for zero-sum stochastic mean payoff games
