References

  1. D. Auger & O. Teyraud (2012): The Frontier of Decidability in Partially Observable Recursive Games. Int. Journal of Foundations of Computer Science 23(7), pp. 1439–1450, doi:10.1142/S0129054112400576.
  2. P. Bouyer, R. Brenguier, N. Markey & M. Ummels (2011): Nash Equilibria in Concurrent Games with Büchi Objectives. In: Proc. 30th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), LIPIcs 13. Leibniz-Zentrum für Informatik, pp. 375–386, doi:10.4230/LIPIcs.FSTTCS.2011.375.
  3. P. Bouyer, R. Brenguier, N. Markey & M. Ummels (2015): Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science 11(2:9), doi:10.2168/LMCS-11(2:9)2015.
  4. P. Bouyer, N. Markey & D. Stan (2014): Mixed Nash Equilibria in Concurrent Games. In: Proc. 33rd Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), LIPIcs 29. Leibniz-Zentrum für Informatik, pp. 351–363, doi:10.4230/LIPIcs.FSTTCS.2014.351.
  5. K. Chatterjee & L. Doyen (2014): Partial-Observation Stochastic Games: How to Win when Belief Fails. ACM Transactions on Computational Logic 15(2:16), doi:10.1145/2579821.
  6. K. Chatterjee, M. Jurdziński & R. Majumdar (2004): On Nash Equilibria in Stochastic Games. In: Proc. 18th Int. Workshop on Computer Science Logic (CSL'04), LNCS 3210. Springer, pp. 26–40, doi:10.1007/978-3-540-30124-0_6.
  7. T. Chen, M. Kwiatkowska, D. Parker & A. Simaitis (2011): Verifying Team Formation Protocols with Probabilistic Model Checking. In: Proc. 12th Int. Workshop on Computational Logic in Multi-Agent Systems (CLIMA'11), LNAI 6814. Springer, pp. 190–207, doi:10.1007/978-3-642-22359-4_14.
  8. A. Das, S. Krishna, L. Manasa, A. Trivedi & D. Wojtczak (2015): On Pure Nash Equilibria in Stochastic Games. In: Theory and Applications of Models of Computation, LNCS 9076. Springer, pp. 359–371, doi:10.1007/978-3-319-17142-5_31.
  9. Thomas A. Henzinger (2005): Games in System Design and Verification. In: Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '05. National University of Singapore, Singapore, Singapore, pp. 1–4. Available at http://doi.acm.org/10.1145/1089933.1089935.
  10. S. Kakutani (1941): A generalization of Brouwer's fixed point theorem. Duke Mathemastical Journal 8(3), pp. 457–459, doi:10.1215/S0012-7094-41-00838-4.
  11. J.F. Nash (1950): Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences of the United States of America 36(1), pp. 48–49, doi:10.1073/pnas.36.1.48.
  12. P. Secchi & W.D. Sudderth (2001): Stay-in-a-Set Games. Int. Journal of Game Theory 30, pp. 479–490, doi:10.1007/s001820200092.
  13. R. Selten (1965): Spieltheoretische Behandlung eines Oligopolmodells mit Nachfrageträgheit. Zeitschrift für die gesamte Staatswissenschaft 121(2), pp. 301–324 and 667–689. Available at http://www.jstor.org/stable/40748884.
  14. R. Selten (1975): A reexamination of the perfectness concept for equilibrium points in extensive games. Int. Journal of Game Theory 4, pp. 25–55, doi:10.1007/BF01766400.
  15. W. Thomas (2002): Infinite Games and Verification. In: Proc. 14th Int. Conf. on Computer Aided Verification (CAV'02), LNCS 2404. Springer, pp. 58–64, doi:10.1007/3-540-45657-0_5. Invited Tutorial.
  16. S.A. Lippman T.M. Liggett (1969): Short Notes: Stochastic Games With Perfect Information and Time Average Payoff. SIAM Review 11(4), pp. 604–607, doi:10.1137/1011093.
  17. M. Ummels (2008): The Complexity of Nash Equilibria in Infinite Multiplayer Games. In: Proc. 11th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'08), LNCS 4962. Springer, pp. 20–34, doi:10.1007/978-3-540-78499-9_3.
  18. M. Ummels & D. Wojtczak (2011): The Complexity of Nash Equilibria in Limit-Average Games. In: Proc. 22nd Int. Conf. on Concurrency Theory (CONCUR'11), LNCS 6901. Springer, pp. 482–496, doi:10.1007/978-3-642-23217-6_32.
  19. M. Ummels & D. Wojtczak (2011): The Complexity of Nash Equilibria in Stochastic Multiplayer Games. Logical Methods in Comp. Science 7(3), doi:10.2168/LMCS-7(3:20)2011.

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