Language Constraints in Multi-Sender Communication Games
摘要
This paper studies optimal communication under language constraints. The model features multiple Senders and a single Receiver, in which the only barrier to communication is a limitation imposed by language: Senders are identically informed, all players have aligned incentives, the state space is infinite, but the Senders’ message spaces are each finite. Thus, while players prefer full information revelation, their language does not allow for it. Efficient communication can always be sustained with a language in which the meaning of message profiles is convex, but the same does not hold for the meaning of individual messages.