Exact algorithms for solving stochastic games
From MaRDI portal
Publication:5419090
DOI10.1145/1993636.1993665zbMath1288.68120OpenAlexW1966861855MaRDI QIDQ5419090
Kristoffer Arnsfelt Hansen, Elias P. Tsigaridas, Michal Koucký, Peter Bro Miltersen, Niels Lauritzen
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993665
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Other game-theoretic models (91A40) Stochastic games, stochastic differential games (91A15)
Related Items (16)
Graph Games and Reactive Synthesis ⋮ A potential reduction algorithm for two-person zero-sum mean payoff stochastic games ⋮ Acceptable strategy profiles in stochastic games ⋮ A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes ⋮ Patience of matrix games ⋮ Stochastic Games ⋮ Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies ⋮ The complexity of solving reachability games using value and strategy iteration ⋮ Shapley–Snow Kernels, Multiparameter Eigenvalue Problems, and Stochastic Games ⋮ Zero-sum stochastic games over the field of real algebraic numbers ⋮ Approximating the existential theory of the reals ⋮ Approximating the existential theory of the reals ⋮ Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems ⋮ New Algorithms for Solving Zero-Sum Stochastic Games ⋮ A formula for the value of a stochastic game ⋮ Qualitative analysis of concurrent mean-payoff games
This page was built for publication: Exact algorithms for solving stochastic games
