Package Auctions and Exchanges
Abstract
We report recent advances concerning the package allocation problem, in which traders seek to buy or sell combinations of goods. The problems are most difficult when some goods are not substitutes. In that case, competitive equilibrium typically fail to exist but the core is non-empty and comprises the competitive solutions. Also in that case, the Vickrey auction fails to select core allocations and yield revenues that are less than competitive. The Ausubel-Milgrom auction generally selects core allocations and, when goods are substitutes, prescribes the Vickrey allocation. We also evaluate the problems and promise of mechanisms for the package exchange problem. Copyright The Econometric Society 2007.Download Info
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.
Bibliographic Info
Article provided by Econometric Society in its journal Econometrica.
Volume (Year): 75 (2007)
Issue (Month): 4 (07)
Pages: 935-965
Contact details of provider:
Phone: 1 212 998 3820
Fax: 1 212 995 4487
Email:
Web page: http://www.econometricsociety.org/
More information through EDIRC
Order Information:
Email:
Web: http://www.blackwellpublishing.com/memb.asp?ref=0012-9682
Related research
Keywords:References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2010.
"The Attack and Defense of Weakest-Link Networks,"
Working Papers
10-14, Chapman University, Economic Science Institute.
- Dan Kovenock J. & Brian Roberson & Roman M. Sheremeta, 2010. "The Attack and Defense of Weakest-Link Networks," CESifo Working Paper Series 3211, CESifo Group Munich.
- Dan Kovenock & Brian Roberson & Roman M. Sheremeta, 2010. "The Attack and Defense of Weakest-Link Networks," Purdue University Economics Working Papers 1256, Purdue University, Department of Economics.
- Kan Takeuchi & John Lin & Yan Chen & Thomas Finholt, 2010. "Scheduling with package auctions," Experimental Economics, Springer, vol. 13(4), pages 476-499, December.
- Paul Milgrom, 2008.
"Assignment Messages and Exchanges,"
Discussion Papers
08-014, Stanford Institute for Economic Policy Research.
- Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:75:y:2007:i:4:p:935-965For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
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.

