Ascending Auctions with Package Bidding

Lawrence M. Ausubel and Paul Milgrom

Working Papers from Stanford University, Department of Economics

Abstract: March 2002

A family of ascending package auction models is introduced in which bidders may determine their own packages on which to bid. In the proxy auction (revelation game) versions, the outcome is a point in the core of the exchange economy for the reported preferences. When payoffs are linear in money and goods are substitutes, sincere reporting constitutes a Nash equilibrium and the outcome coincides with the Vickrey auction outcome. Even when goods are not substitutes, ascending proxy auction equilibria lie in the core with respect to the true preferences. Compared to the Vickrey auction, the proxy auctions generate higher equilibrium revenues, are less vulnerable to collusion, can handle budget constraints much more robustly, and may provide better ex ante investment incentives.

Working Papers Index

Date: 2002-03
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (246)

Downloads: (external link)
http://www-econ.stanford.edu/faculty/workp/swp02004.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www-econ.stanford.edu/faculty/workp/swp02004.pdf [301 Moved Permanently]--> https://www-econ.stanford.edu/faculty/workp/swp02004.pdf [307 Temporary Redirect]--> https://economics.stanford.edu//faculty/workp/swp02004.pdf)

Related works:
Journal Article: Ascending Auctions with Package Bidding (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:stanec:02004

Access Statistics for this paper

More papers in Working Papers from Stanford University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel (krichel@openlib.org).