Commitment and Randomization in Communication
Emir Kamenica, Xiao Lin

TL;DR
This paper characterizes when a Sender in a communication game values commitment, showing it depends on whether optimal experiments involve randomization, with implications for strategic grading policies.
Contribution
It provides a generic characterization of when commitment has value in finite action-state settings, linking it to the necessity of randomization in equilibrium.
Findings
Commitment has no value if and only if a partitional experiment is optimal.
If randomization is necessary in equilibrium, then commitment is valued.
The share of preference profiles where commitment has no value converges to 1/|A|^{|A|} as states grow large.
Abstract
When does Sender, in a Sender-Receiver game, strictly value commitment? In a setting with finitely many actions and states, we establish that, generically, commitment has no value if and only if a partitional experiment is optimal. Moreover, if Sender's preferred cheap-talk equilibrium necessarily involves randomization, then Sender values commitment. Our results imply that if a school values commitment to a grading policy, then the school necessarily prefers to grade unfairly. We also ask: for what share of preference profiles does commitment have no value? For any state space, if there are actions, the share is at least . As the number of states grows large, the share converges precisely to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications
