Solving Simple Stochastic Games

DOI10.1007/978-3-540-69407-6_24zbMath1142.91332OpenAlexW1834884798MaRDI QIDQ3507435

Hugo Gimbert, Florian Horn

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_24

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15) Computational methods for problems pertaining to game theory, economics, and finance (91-08)

Related Items (2)

Equilibrium in two-player stochastic games with shift-invariant payoffs ⋮ Another sub-exponential algorithm for the simple stochastic game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Exact solution of linear equations using p-adic expansions
• The complexity of stochastic games
• A subexponential randomized algorithm for the simple stochastic game problem
• Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
• Solving Simple Stochastic Games with Few Random Vertices
• Stochastic Games

This page was built for publication: Solving Simple Stochastic Games