Computing Nash Equilibria of Unbounded Games
Author:
Escardo Martin,Oliva Paulo
Abstract
Using 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.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Well-Founded Extensive Games with Perfect Information;Electronic Proceedings in Theoretical Computer Science;2021-06-22