Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games

DOI10.1007/978-3-319-06089-7_6zbMath1405.68132arXiv1402.0471OpenAlexW115934038MaRDI QIDQ5410636

David Auger, Pierre Coucheney, Yann Strozecki

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

stochastic gamesalgorithmic game theoryFPT algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15)

Related Items (3)

Solving generic nonarchimedean semidefinite programs using stochastic game algorithms ⋮ Unnamed Item ⋮ A non-iterative algorithm for generalized pig games

This page was built for publication: Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games