Strategic information transmission with sender's approval: The single-crossing case
We consider games in which an informed sender first talks at no cost to a receiver; then, the latter proposes a decision and, finally, the sender accepts the proposal or “exits”. We make the following assumptions: the sender has finitely many types, the receiver's decision is real-valued, utili...
Uloženo v:
| Vydáno v: | Games and economic behavior Ročník 134; s. 242 - 263 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article Paper |
| Jazyk: | angličtina |
| Vydáno: |
St. Louis
Elsevier Inc
01.07.2022
Federal Reserve Bank of St. Louis Elsevier |
| Témata: | |
| ISSN: | 0899-8256, 1090-2473 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | We consider games in which an informed sender first talks at no cost to a receiver; then, the latter proposes a decision and, finally, the sender accepts the proposal or “exits”. We make the following assumptions: the sender has finitely many types, the receiver's decision is real-valued, utility functions over decisions are concave, single-peaked and single-crossing, exit is damaging to the receiver. In this setup, it may happen that babbling equilibria necessarily involve exit. We nevertheless propose a constructive algorithm that achieves a pure perfect Bayesian equilibrium without exit in every game of the class considered. |
|---|---|
| Bibliografie: | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| ISSN: | 0899-8256 1090-2473 |
| DOI: | 10.1016/j.geb.2022.05.004 |