A Folk Theorem for Repeated Sequential Games
From MaRDI portal
Recommendations
Cited in
(17)- Are ``Anti-Folk Theorems in repeated games nongeneric?
- Macro meets micro: stochastic (Calvo) revisions in games
- The effective minimax value of asynchronously repeated games
- On asynchronously repeated games
- Crowding games are sequentially solvable
- Coordination need not be a problem
- Dynamic moral hazard without commitment
- Allowing two moves in succession increases the game's bias: A theorem
- The "Folk Theorem" for Repeated Games with Complete Information
- A Folk Theorem for Asynchronously Repeated Games
- The effects of leniency on cartel pricing
- Protocol invariance and the timing of decisions in dynamic games
- Repeated sequential prisoner's dilemma: the Stackelberg variant
- Analysing the folk theorem for linked repeated games
- Infinite horizon common interest games with perfect information
- A folk theorem for the one-dimensional spatial bargaining model
- Maintenance in single-server queues: a game-theoretic approach
This page was built for publication: A Folk Theorem for Repeated Sequential Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789814)