When can you play positionally?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 686-697

  Gimbert, Hugo ^a   Zielonka, Wieslaw ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FINITE GRAPHS; MEAN PAYOFF; MEMORYLESS; OPTIMAL STRATEGIES; PAYOFF MAPPINGS;

MAPPING;

EID: 26844491346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_53     Document Type: Article

References (13)

1. Henrik Björklund, Sven Sandberg, and Sergei Vorobyov. Memoryless determinacy of parity and mean payoff games: a simple proof. Theor. Computer Science, 310:365-378, 2004.
2. Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, and Marielle Stoelinga. Model checking discounted temporal properties. In TAC AS 2004, volume 2988 of LNCS, pages 77-92. Springer, 2004.
3. Luca de Alfaro, Thomas A. Henzinger, and Rupak Majumdar. Discounting the future in systems theory. In 1C ALP 2003, volume 2719 of LNCS, pages 1022-1037. Springer, 2003.
4. Andrzej Ehrenfeucht and Jerzy Mycielski. Positional strategies for mean payoff games. Intern. J. of Game Theory, 8:109-113, 1979.
5. E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In FOCS'91, pages 368-377. IEEE Computer Society Press, 1991.
6. Jerzy Filar and Koos Vrieze. Competitive Markov Decision Processes. Springer, 1997.
7. Y. Gurevich and L. Harrington. Trees, automata and games. In Proc. 17th Symp. on the Theory of Comp., pages 60-65. IEEE Computer Society Press, 1982.
8. Ashok P. Maitra and William D. Sudderth. Discrete Gambling and Stochastic Games. Springer.
9. A.W. Mostowski. Games with forbidden positions. Technical Report 78, Uniwersytet Gdanski, Instytut Matematyki, 1991.
10. Hervé Moulin. Prolongements des jeux á deux joueurs de somme nulle. Une théorie abstraite des duels. Bull. Soc. math. France, pages 1-111, 1976. Mémoire 45.
11. T.E.S Raghavan. Finite-step algorithms for single-controller and perfect information stochastic games. In A. Neyman and S. Sorin, editors, Stohastic Games and Applications, volume 570 of NATO Science Series C, Mathematical and Physical Sciences, pages 227-251. Kluwer Academic Publishers, 2003.
12. L. S. Shapley. Stochastic games. Proceedings Nat. Acad. of Science USA, 39:10951100, 1953.
13. Wieslaw Zielonka. Perfect-information stochastic parity games. In FOSSACS 2004, volume 2987 of LNCS, pages 499-513. Springer, 2004.