Computing Nash equilibria of unbounded games

DOI10.29007/1WPLMaRDI QIDQ6874964zbMATH OpenFDO

Authors Martín Escardo, Paulo Oliva

Publication date 14 January 2026

Full work available at URL https://doi.org/10.29007/1WPL

zbMATH Keywords

backward inductionbar recursionNash equilibriumselection functionssubgame optimal equilibrium

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Structure of proofs (03F07) Noncooperative games (91A10)

Cites work

• Backward induction and common knowledge of rationality
• Backward induction and the game-theoretic analysis of chess.
• Computational Interpretations of Analysis via Products of Selection Functions
• Game theory evolving. A problem-centered introduction to modeling strategic interaction
• Games of perfect information, predatory pricing and the chain-store paradox
• scientific article; zbMATH DE number 5301288 (Why is no real title available?)
• scientific article; zbMATH DE number 51623 (Why is no real title available?)
• scientific article; zbMATH DE number 3231083 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Learning to be imperfect: The ultimatum game
• Modified bar recursion
• On the backward induction method
• On the computational content of the axiom of choice
• Rationality, Nash Equilibrium and Backwards Induction in Perfect- Information Games
• Selection functions, bar recursion and backward induction
• Sequential games and optimal strategies
• Zermelo and the early history of game theory
• Zur Theorie der Gesellschaftsspiele.
• Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels.
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES

This page was built for publication: Computing Nash equilibria of unbounded games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874964)