References

1. Jade Alglave & Assia Mahboubi (2011): A Generic Formalised Framework for Reasoning About Weak Memory Models. Available at https://hal.inria.fr/inria-00604656. Working paper or preprint.
2. K. Appel & W. Haken (1976): Special announcement. Discrete Mathematics 16(2), pp. 179–180, doi:10.1016/0012-365X(76)90147-3.
3. Thomas Brihaye, Véronique Bruyère & Julie De Pril (2010): Equilibria in Quantitative Reachability Games. In: Farid Ablayev & Ernst W. Mayr: Computer Science – Theory and Applications: 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 72–83, doi:10.1007/978-3-642-13182-0_7.
4. Cristian S Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li & Frank Stephan (2017): Deciding Parity Games in Quasi-Polynomial Time. Accepted at STOC 2017.
5. Krishnendu Chatterjee, Thomas A. Henzinger & Marcin Jurdziński (2006): Games with secure equilibria. Theoretical Computer Science 365(1), pp. 67 – 82, doi:10.1016/j.tcs.2006.07.032.
6. Christoph Dittmann (2016): Positional Determinacy of Parity Games. Available at www.isa-afp.org/browser_info/devel/AFP/Parity_Game/outline.pdf.
7. E.A. Emerson & C.S. Jutla (1991): Tree automata, mu-calculus and determinacy. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, pp. 368–377, doi:10.1109/sfcs.1991.185392.
8. Allan Gibbard (1973): Manipulation of Voting Schemes: A General Result. Econometrica 41(4), pp. 587–601, doi:10.2307/1914083.
9. Georges Gonthier (2008): Formal Proof—The Four-Color Theorem. Notices of the American Mathematical Society 55(11), pp. 1382–1393. Available at http://www.ams.org/notices/200811/tx081101382p.pdf.
10. Y. Gurevich & L. Harrington (1982): Trees, automata, and games. In: STOC'82. ACM Press, pp. 60–65, doi:10.1145/800070.802177.
11. Vladimir Gurvich (1975): Solution of positional games in pure strategies. USSR Comput. Math. and Math. Phys. 15(2), pp. 358–371, doi:10.1016/0041-5553(75)90042-7. Originally written in Russian.
12. Vladimir Gurvich (1989): Equilibrium in pure strategies. Soviet Math. Dokl 38(3), pp. 597–602.
13. Stéphane Le Roux (2009): Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence. In: Stefan Berghofer, Tobias Nipkow, Christian Urban & Makarius Wenzel: Theorem Proving in Higher Order Logics: 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 293–309, doi:10.1007/978-3-642-03359-9_21.
14. Stéphane Le Roux (2014): From winning strategy to Nash equilibrium. Math. Log. Q. 60(4-5), pp. 354–371, doi:10.1002/malq.201300034.
15. Pierre Lescanne & Matthieu Perrinel (2012): ``Backward'' coinduction, Nash equilibrium and the rationality of escalation. Acta Informatica 49(3), pp. 117–137, doi:10.1007/s00236-012-0153-3.
16. Donald A. Martin (1975): Borel Determinacy. The Annals of Mathematics 102(2), pp. 363–371, doi:10.2307/1971035.
17. Erik Martin-Dorel & Sergei Soloviev (2017): A Formal Study of Boolean Games with Random Formulas as Pay Functions. Available at https://www.irit.fr/publis/ACADIE/IRIT-RR-2017-01-FR.pdf. Research Report.
18. H Moulin & B Peleg (1982): Cores of effectivity functions and implementation theory. Journal of Mathematical Economics 10(1), pp. 115 – 145, doi:10.1016/0304-4068(82)90009-X.
19. René Vestergaard (2006): A constructive approach to sequential Nash equilibria. Information Processing Letters 97(2), pp. 46 – 51, doi:10.1016/j.ipl.2005.09.010.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org