1. N. Asher, E. McReady & S. Paul (2012): Strategic Politeness. In: LENLS 9.
  2. N. Asher & S. Paul (2012): Conversations as Banach-Mazur Games. Dialogue and Discourse (submitted).
  3. D. Gale & F. M. Stewart (1953): Infinite Games with Perfect Information. Annals of Mathematical Studies 28, pp. 245–266.
  4. Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002): Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science 2500. Springer, doi:10.1007/3-540-36387-4.
  5. Y. Gurevich & L. Harrington (1982): Trees, automata and games. Proceedings of the 14th Annual Symposium on Theory of Computing, pp. 60–65, doi:10.1145/800070.802177.
  6. Akihiro Kanamori (2003): The higher infinite : large cardinals in set theory from their beginnings. Springer.
  7. A Kechris (1995): Classical descriptive set theory. Springer-Verlag, New York, doi:10.1007/978-1-4612-4190-4.
  8. A. W. Mostowski (1991): Games with forbidden positions. Technical Report. Instytut Matematyki, Universytet Gdanski, Poland.
  9. D. Perrin & J. E. Pin (1995): Infinite Words - Automata, Semigroups, Logic and Games. Elsevier, doi:10.1007/978-94-011-0149-3_3.
  10. Olivier Serre (2004): Games with Winning Conditions of High Borel Complexity. In: ICALP, pp. 1150–1162, doi:10.1016/j.tcs.2005.10.024.
  11. William W. Wadge (1983): Reducibility and determinateness on the Baire space. UC, Berkeley.

Comments and questions to:
For website issues: