Number of the records: 1
Exact algorithms for solving stochastic games
- 1.
SYSNO ASEP 0369977 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Exact algorithms for solving stochastic games Author(s) Hansen, A. K. (DK)
Koucký, Michal (MU-W) RID, SAI, ORCID
Lauritzen, N. (DK)
Miltersen, P.B. (DK)
Tsigaridas, E.P. (DK)Source Title Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC 2011). - New York : ACM, 2011 / Fortnow L. ; Vadhan S.P. - ISBN 978-1-4503-0691-1 Pages s. 205-214 Number of pages 10 s. Action 43rd annual ACM symposium on Theory of computing (STOC 2011) Event date 06.06.2011-08.06.2011 VEvent location San José Country US - United States Event type WRD Language eng - English Country US - United States Keywords stochastic games ; recursive games ; algorithms Subject RIV BA - General Mathematics R&D Projects GAP202/10/0854 GA ČR - Czech Science Foundation (CSF) IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) CEZ AV0Z10190503 - MU-W (2005-2011) UT WOS 000297656800022 EID SCOPUS 79959769873 DOI 10.1145/1993636.1993665 Annotation Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games. When the number of positions of the game is constant, our algorithms run in polynomial time. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2012
Number of the records: 1