Abstract

This paper examines repeated games in which each player observes a private and imperfect signal on the actions played, and in which players are allowed to communicate using public messages. Providing incentives for players to reveal their observations generates (revelation) constraints that, combined with signal imperfections, may be a source of inefficiencies. However, by delaying the revelation of their observations, players may economize on the cost of deterring deviations, and thereby avoid these inefficiencies. Because a player would not want to trigger a sanction that would penalize him too, revelation constraints also tend to make sanctions difficult to enforce. However, with at least three players, detecting deviations may not require that all the players reveal their observations. In that case, we obtain a Nash threat version of the Folk theorem. With two players, we do not obtain a similar result. Nevertheless, we show that an efficient outcome can (almost) always be approximated.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.