Randomization, Communication and Efficiency in Repeated Games with Imperfect Public Monitoring
Michihiro Kandori
Abstract
Open-access reader
Michihiro Kandori
Abstract
Open-access reader
The present paper shows that the Folk Theorem under imperfect (public) information (Fudenberg, Levine and Maskin (1994)) can be obtained under much weaker set of assumptions, if we allow communication among players. Our results in particular show that for generic symmetric games with at least four players, we can drop the FLM condition on the number of actions and signals altogether and prove the folk theorem under the same condition as in the perfect monitoring case.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The present paper shows that the Folk Theorem under imperfect (public) information (Fudenberg, Levine and Maskin (1994)) can be obtained under much weaker set of assumptions, if we allow communication among players. Our results in particular show that for generic symmetric games with at least four players, we can drop the FLM condition on the number of actions and signals altogether and prove the folk theorem under the same condition as in the perfect monitoring case.
Key concepts: Folk theorem, Imperfect, Repeated game, Mathematical economics, Set (abstract data type), Perfect information, Mathematics, Discrete mathematics