The myth of the folk theorem
From MaRDI portal
Publication:993783
Recommendations
Cites work
- scientific article; zbMATH DE number 4202070 (Why is no real title available?)
- scientific article; zbMATH DE number 592673 (Why is no real title available?)
- Calibrated learning and correlated equilibrium
- Learning, regret minimization, and equilibria
- Nash and correlated equilibria: Some complexity considerations
- On the complexity of the parity argument and other inefficient proofs of existence
- Rational Learning Leads to Nash Equilibrium
- The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
- The approximation complexity of win-lose games
- The complexity of computing a Nash equilibrium
Cited in
(10)- Equilibrium paths in discounted supergames
- Robust and scalable middleware for selfish-computer systems
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff
- Convergence of incentive-driven dynamics in Fisher markets
- How Robust Is the Folk Theorem?*
- Complexity of rational and irrational Nash equilibria
- Semidefinite programming for min-max problems and games
- The real computational complexity of minmax value and equilibrium refinements in multi-player games
- Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players
- Busting a Myth about Leśniewski and Definitions
This page was built for publication: The myth of the folk theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993783)