Backward induction for repeated games
From MaRDI portal
Publication:3384909
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
Cites work
- scientific article; zbMATH DE number 2013199 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Equilibrium points in n -person games
- Essentials of game theory. A concise, multidisciplinary introduction.
- Exhaustible sets in higher-type computation
- Higher-order decision theory
- Microeconomic theory
- Monad transformers for backtracking search
- Notions of computation and monads
- Selection functions, bar recursion and backward induction
- Sequential games and optimal strategies
- Synthetic topology: of data types and classical spaces
- The Herbrand functional interpretation of the double negation shift
- 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
Cited in
(4)
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)