References

  1. Martin Escardó (1998): Effective and sequential definition by cases on the reals via infinite signed-digit numerals. In: Proceedings of the 3rd workshop on Computation and Approximation, ENTCS 13, doi:10.1016/S1571-0661(05)80214-2.
  2. Martin Escardó (2004): Synthetic topology of data types and classical spaces. ENTCS 87, pp. 21–156, doi:10.1016/j.entcs.2004.09.017.
  3. Martin Escardó (2007): Seemingly impossible functional programs. Available at http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/.
  4. Martin Escardó (2008): Exhaustible sets in higher-type computation. Logical methods in computer science 4(3:3), pp. 1–37, doi:10.2168/lmcs-4(3:3)2008.
  5. Martin Escardó & Paulo Oliva (2010): Selection functions, bar recursion and backward induction. Mathematical structures in computer science 20(2), pp. 127–168, doi:10.1017/S0960129509990351.
  6. Martin Escardó & Paulo Oliva (2010): What sequential games, the Tychonoff theorem and the double-negation shift have in common. In: Proceedings of MSFP'10, doi:10.1145/1863597.1863605.
  7. Martin Escardó & Paulo Oliva (2011): Sequential games and optimal strategies. Proceedings of the Royal Society A 467, pp. 1519–1545, doi:10.1098/rspa.2010.0471.
  8. Martin Escardó & Paulo Oliva (2012): Computing Nash equilibria of unbounded games. Proceedings of the Turing centenary conference. Available at http://www.easychair.org/publications/paper/106503.
  9. Martin Escardó & Paulo Oliva (2017): The Herbrand functional interpretation of the double negation shift. Journal of symbolic logic 82(2), pp. 590–607, doi:10.1017/jsl.2017.8.
  10. Jules Hedges (2014): Monad transformers for backtracking search. In: Proceedings of MSFP'14, EPTCS, pp. 31–50, doi:10.4204/EPTCS.153.3.
  11. Jules Hedges (2015): The selection monad as a CPS translation. ArXiv:1503.06061.
  12. Jules Hedges (2016): Towards compositional game theory. Queen Mary University of London.
  13. Jules Hedges, Paulo Oliva, Evguenia Shprits, Viktor Winschel & Philipp Zahn (2017): Selection equilibria of higher-order games. In: Practical aspects of declaritive languages, Lecture Notes in Computer Science 10137. Springer, pp. 136–151, doi:10.1007/978-3-319-51676-9_9.
  14. 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.
  15. Kevin Leyton-Brown & Yoav Shoham (2008): Essentials of game theory: a concice, multidisciplinary introduction. Morgan and Claypool.
  16. George Mailath & Larry Samuelson (2006): Repeated games and reputations. Oxford University Press, doi:10.1093/acprof:oso/9780195300796.001.0001.
  17. Andreu Mas-Colell, Michael Whinston & Jerry Green (1995): Microeconomic theory. Oxford University Press.
  18. Eugenio Moggi (1991): Notions of computation and monads. Information and Computation 93, pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  19. John Nash (1950): Equilibrium points in n-person games. Proceedings of the National Academy of Sciences 36(1), pp. 48–49, doi:10.1073/pnas.36.1.48.
  20. John von Neumann & Oskar Morgenstern (1944): Theory of games and economic behaviour. Princeton University Press.
  21. Ulrich Schwalbe & Paul Walker (2001): Zermelo and the early history of game theory. Games and economic behaviour 34, pp. 123–137, doi:10.1006/game.2000.0794.
  22. Klaus Weihrauch (1995): A simple introduction to computable analysis. Technical Report. Fern Universität.

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