The folk theorem for all games with almost perfect monitoring
"Selection in Dynamic Games" 1. Assortative Matching with costly search, presented by Alp Atakan 2. A Refinement of Sequential Equilibrium with Application to Decentralized Collusion, presented by Peter Eso 3. Noisy evolution in Normal form Games, presented by Christoph Kuzmics 4. The folk theorem for all games with almost perfect monitoring presented by Johannes Horner Abstract: We study repeated games in which monitoring is imperfect and private. We prove the folk theorem for all two-player (finite) games assuming that the monitoring is almost perfect, but not necessarily almost public
In order to set up a list of libraries that you have access to,
you must first login
or sign up.
Then set up a personal list of libraries from your profile page by
clicking on your user name at the top right of any screen.