Qualification: The Folk Theorem in Repeated Games With Anonymous Random Matching
Deb, Sugaya, and Wolitzky sharply bound Kaal's use of the anonymous-random-matching Folk Theorem. They prove a Folk Theorem for discounted repeated games with anonymous random matching, allowing nonuniform matching and asymmetric payoffs, but retain full dimensionality as a stage-game condition. Their result supports treating the theorem as a conditional benchmark within that model. It does not provide a general performance floor for an implemented reputation mechanism, predict which equilibrium will occur, or establish any outcome in Kaal's reference system.
Affirmed commentary position. This record extends a source-bound scholarly claim but is not a verbatim paper claim.
Holds when
Current debate
Scholarly basis
Evidence and mapping
Topics
economicsinstitutional-designscholarly-growth-coveragescholarly-literaturegame-theoryfolk-theoremrepeated-gamesanonymous-random-matching
Provenance
Verify