We examine a model of limited communication in which the seller is selling a single good to two potential buyers. Limited communication is modeled as follows: in each of the finite number of periods the seller asks one of the two buyers a binary question. After the final answer, the allocation and the transfers are executed. The model sheds light on the communication protocols that arise in welfare maximizing mechanisms. Among other things, we show that when the total number of questions is bounded the welfare optimal mechanism requires the seller to start with questioning one of the buyers and conclude with a single last question to the other buyer.
|Date of creation:||2011|
|Contact details of provider:|| Postal: via Rontgen, 1 - 20136 Milano (Italy)|
Web page: http://www.igier.unibocconi.it/
|Order Information:|| Web: http://www.igier.unibocconi.it/en/papers/index.htm Email: |
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Myerson, Roger B, 1979.
"Incentive Compatibility and the Bargaining Problem,"
Econometric Society, vol. 47(1), pages 61-73, January.
- Roger B. Myerson, 1977. "Incentive Compatability and the Bargaining Problem," Discussion Papers 284, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Pierpaolo Battigalli & Giovanni Maggi, 2002. "Rigidity, Discretion, and the Costs of Writing Contracts," American Economic Review, American Economic Association, vol. 92(4), pages 798-817, September. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:igi:igierp:405. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.