References

  1. E. Boros & V. Gurvich (2003): On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. Mathematical Social Sciences 46(2), pp. 207 – 241, doi:10.1016/S0165-4896(03)00077-5.
  2. Endre Boros, Vladimir Gurvich, Martin Milanič, Vladimir Oudalov & Jernej Vičič (2018): A three-person deterministic graphical game without Nash equilibria. Discrete Applied Mathematics 243, pp. 21 – 38, doi:10.1016/j.dam.2018.01.008.
  3. Patricia Bouyer, Nicolas Markey & Daniel Stan (2014): Mixed Nash Equilibria in Concurrent Terminal-Reward Games. In: Venkatesh Raman & S. P. Suresh: FSTTCS 2014, Leibniz International Proceedings in Informatics (LIPIcs) 29. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 351–363, doi:10.4230/LIPIcs.FSTTCS.2014.351.
  4. Krishnendu Chatterjee & Thomas A. Henzinger (2012): A survey of stochastic ω-regular games. J. Comput. Syst. Sci 78(2), pp. 394–413, doi:10.1016/j.jcss.2011.05.002.
  5. Krishnendu Chatterjee, Rupak Majumdar & Marcin Jurdzinski (2004): On Nash Equilibria in Stochastic Games. In: Jerzy Marcinkowski & Andrzej Tarlecki: CSL 2004, Lecture Notes in Computer Science 3210. Springer, pp. 26–40, doi:10.1007/978-3-540-30124-0_6.
  6. H. Everett (1957): Recursive Games. In: Contributions to the Theory of Games Vol. III, Ann. Math. Studies 39. Princeton University Press, pp. 67–78, doi:10.1515/9781400882151-004.
  7. A. M. Fink (1964): Equilibrium in a stochastic n-person game. J. Sci. Hiroshima Univ. Ser. A-I Math. 28(1), pp. 89–93, doi:10.32917/hmj/1206139508.
  8. János Flesch, Frank Thuijsman & O. J. Vrieze (1996): Recursive Repeated Games with Absorbing States. Math. Oper. Res 21(4), pp. 1016–1022, doi:10.1287/moor.21.4.1016.
  9. D. Gillette (1957): Stochastic games with zero stop probabilities. In: Contributions to the Theory of Games III, Ann. Math. Studies 39. Princeton University Press, pp. 179–187, doi:10.1515/9781400882151-011.
  10. Jeroen Kuipers, János Flesch, Gijs Schoenmakers & Koos Vrieze (2009): Pure subgame-perfect equilibria in free transition games. European Journal of Operational Research 199(2), pp. 442 – 447, doi:10.1016/j.ejor.2008.11.038.
  11. Ashok P. Maitra & William D. Sudderth (1998): Finitely additive stochastic games with Borel measurable payoffs. Int. J. Game Theory 27(2), pp. 257–267, doi:10.1007/s001820050071.
  12. Donald A. Martin (1975): Borel Determinacy. Annals of Mathematics 102(2), pp. 363–371, doi:10.2307/1971035.
  13. Donald A. Martin (1998): The Determinacy of Blackwell Games. J. Symb. Log 63(4), pp. 1565–1581, doi:10.2307/2586667.
  14. J.F. Mertens (1987): Repeated Games. In: Proceedings of the International Congress of Mathematicians, 1986. American Mathical Society, San Diego, pp. 1528–1577.
  15. J.F. Mertens & A. Neyman (1981): Stochastic Games. Int. J. of Game Theory, pp. 53–66, doi:10.1007/BF01769259.
  16. Piercesare Secchi & William D. Sudderth (2002): Stay-in-a-set games. Int. J. Game Theory 30(4), pp. 479–490, doi:10.1007/s001820200092.
  17. L.S. Shapley (1953): Stochastic Games. Proc. Natl. Acad. Sci. U. S. A. 39, pp. 1095–1100, doi:10.1073/pnas.39.10.1095.
  18. Robert Samuel Simon (2006): Value and perfection in stochastic games. Israel Journal of Mathematics 156(1), pp. 285–309, doi:10.1007/bf02773836.
  19. Masayuki Takahashi (1964): Equilibrium points of stochastic non-cooperative n-person games. J. Sci. Hiroshima Univ. Ser. A-I Math. 28(1), pp. 95–99, doi:10.32917/hmj/1206139509.
  20. Michael Ummels & Dominik Wojtczak (2011): The Complexity of Nash Equilibria in Limit-Average Games. In: Joost-Pieter Katoen & Barbara König: CONCUR 2011. Springer Berlin Heidelberg, pp. 482–496, doi:10.1007/978-3-642-23217-6_32.
  21. Nicolas Vieille (2000): Two-player stochastic games I: A reduction. Israel Journal of Mathematics 119(1), pp. 55–91, doi:10.1007/bf02810663.
  22. Nicolas Vieille (2000): Two-player stochastic games II: The case of recursive games. Israel Journal of Mathematics 119(1), pp. 93–126, doi:10.1007/bf02810664.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org