Sender-receiver game with receiver commitment and restricted number of messages
We investigate a long-run sender-receiver game in which the receiver commits to a strategy. A sequence of state is generated i.i.d. and processed by the sender which has less available messages than states. Before the game is played, the receiver commits to a strategy that assigns a sequence of actions to each possible messages from the sender. When the length of the sequences of states and actions increases, we provide lower and upper bounds on the receiver optimal utility by taking into account the incentive constraints of the sender.
Séance accessible sur Zoom. Lien envoyé mardi 1er février, avant le séminaire.
Participants extérieurs : écrire par courriel à Nicolas FREMEAUX.
Plus d'informations sur le site internet du LEMMA