University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Nash Equilibrium, Bekic's Lemma and Bar Recursion

Nash Equilibrium, Bekic's Lemma and Bar Recursion

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Bjarki Holm.

In this talk I will discuss three apparently unrelated topics: (1) The construction of backward induction, which computes Nash equilibrium strategies in n-players sequential games, (2) the proof of Bekic’s lemma which says that the Cartesian product of n spaces which have a fixed point operator will also have a fixed point operator, and (3) the computational interpretation of analytical principles such as countable choice via Spector’s bar recursion. The aim of the talk is to show how these three results rely on exactly the same construction, which we have identified as the iterated product of selection functions. This is based on recent joint work with Martín Escardó.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity