Backward induction for repeated games

MaRDI QIDQ3384909FDOQ3384909

Authors: Jules Hedges 

Publication date: 17 December 2021

Full work available at URL: https://arxiv.org/abs/1804.07074

Recommendations

• scientific article; zbMATH DE number 1859184
• Algorithms for finding repeated game equilibria
• Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players
• Computing equilibria in discounted dynamic games
• ``Backward coinduction, Nash equilibrium and the rationality of escalation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• Equilibrium points in n -person games
• Microeconomic theory
• Notions of computation and monads
• Essentials of game theory. A concise, multidisciplinary introduction.
• Synthetic topology: of data types and classical spaces
• Sequential games and optimal strategies
• Selection functions, bar recursion and backward induction
• Exhaustible sets in higher-type computation
• The Peirce translation and the double negation shift
• Zermelo and the early history of game theory
• ``Backward coinduction, Nash equilibrium and the rationality of escalation
• Title not available (Why is that?)
• Higher-order decision theory
• The Herbrand functional interpretation of the double negation shift
• Monad transformers for backtracking search

Cited In (4)

• Games with 1-backtracking
• Translating extensive form games to open games with agency
• Towards foundations of categorical cybernetics
• Branching time, perfect information games, and backward induction

This page was built for publication: Backward induction for repeated games

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