Communication and efficiency in auctions
We study auctions under restricted communication. Agents have valuations distributed over an interval but can only report one of a finite number of messages. We provide necessary conditions for welfare as well as revenue maximizing auctions in the independent private values case when bidders report simultaneously. We also show that the seller who chooses how to allocate a fixed number of messages allocates them evenly over all agents.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- Paul Milgrom, 2008.
"Simplified Mechanisms with an Application to Sponsored-Search Auctions,"
08-013, Stanford Institute for Economic Policy Research.
- Milgrom, Paul, 2010. "Simplified mechanisms with an application to sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 70(1), pages 62-70, September.
- Kenneth Mount & Stanley Reiter, 1973.
"The Informational Size of Message Spaces,"
3, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- R. Preston McAfee, 2002. "Coarse Matching," Econometrica, Econometric Society, vol. 70(5), pages 2025-2034, September.
- 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.
- Bergemann, Dirk & Pesendorfer, Martin, 2007.
"Information structures in optimal auctions,"
Journal of Economic Theory,
Elsevier, vol. 137(1), pages 580-609, November.
- Bergemann, Dirk & Pesendorfer, Martin, 2001. "Information Structures in Optimal Auctions," CEPR Discussion Papers 2991, C.E.P.R. Discussion Papers.
- Dirk Bergemann & Martin Pesendorfer, 2001. "Information Structures in Optimal Auctions," Cowles Foundation Discussion Papers 1323, Cowles Foundation for Research in Economics, Yale University.
- Athey, Susan, 2001.
"Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information,"
Econometric Society, vol. 69(4), pages 861-889, July.
- Athey, S., 1997. "Sigle Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information," Working papers 97-11, Massachusetts Institute of Technology (MIT), Department of Economics.
- 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.
- Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
- Rothkopf, Michael H. & Harstad, Ronald M., 1994. "On the role of discrete bid levels in oral auctions," European Journal of Operational Research, Elsevier, vol. 74(3), pages 572-581, May.
- Nenad Kos, 2011. "Asking Questions," Working Papers 405, IGIER (Innocenzo Gasparini Institute for Economic Research), Bocconi University.
- Wilson, Robert B, 1989. "Efficient and Competitive Rationing," Econometrica, Econometric Society, vol. 57(1), pages 1-40, January.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:75:y:2012:i:1:p:233-249. 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: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.