Download PDFOpen PDF in browserComputing Nash Equilibria of Unbounded Games13 pages•Published: June 22, 2012AbstractUsing techniques from higher-type computability theory and proof theory we extend the well-known game-theoretic technique of backward induction to finite games of unbounded length. The main application is a closed formula for calculating strategy profiles in Nash equilibrium and subgame perfect equilibrium even in the case of games where the length of play is not a-priori fixed.Keyphrases: backward induction, bar recursion, nash equilibrium, selection functions, subgame optimal equilibrium In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 53-65.
|