Sending information to interactive receivers playing a generalized prisoners' dilemma

摘要

Consider the problem of information disclosure for a planner who faces two agents interacting in a state-dependent multi-action prisoners' dilemma. We find conditions under which the planner can make use of his superior information by disclosing some of it to the agents, and conditions under which such information leakage is not possible. Although the problem is entirely symmetric, the planner's only way to reveal part of the information is based on creating asymmetries between the two agents by giving them different pieces of information. We also find conditions under which such partially informative equilibria are the planner's best equilibria.