Skip to main content Accessibility help
×
Home
  • Print publication year: 2017
  • Online publication date: October 2017

13 - On the Impossibility of Core-Selecting Auctions

from Part II - The Combinatorial Clock Auction Designs

Summary

Introduction

Practical auction design is often complicated by institutional details and legal or political constraints. For example, using bidder-specific bidding credits or reserve prices may be considered discriminatory and unlawful in some countries making it impossible to implement an optimal auction design. More generally, the use of sizeable reserve prices may cause political stress due to the fear that it slows down technological progress when licenses remain unsold. While constraints of this nature are common and important in practice, mechanism design theory has typically treated them as secondary to incentive constraints.

Recent work by Day and Raghavan (2007), Day and Milgrom (2008), and Day and Cramton (2008) breaks with this tradition and asks how close incentive constraints can be approximated if other (institutional or political) constraints are put first. In particular, these authors have proposed an alternative payment rule to fix some drawbacks of the well-known Vickrey-Clarke-Groves mechanism, or “Vickrey auction” for short. When goods are substitutes the Vickrey auction produces an outcome, i.e. an allocation and payoffs for the seller and bidders, that is in the core. However, when goods are complements, the Vickrey outcome, while efficient, is not necessarily in the core and seller revenue can be very low as a result. Furthermore, non-core outcomes are “unfair” in that there are bidders willing to pay more than the winners’ payments, which makes the auction vulnerable to defections as the seller can attract better offers afterwards. The low revenue, perceived unfairness, and instability of Vickrey outcomes can create legal and political problems, which the alternative payment rule seeks to avoid.

The types of auctions proposed by Day et al. employ a payment rule that insures that outcomes are in the core with respect to reported values, i.e. the final allocation maximizes the total reported value and no coalition of bidders can block the outcome with respect to bidders’ reports. Unless reported values are always truthful, however, it does not imply that core outcomes are produced with respect to bidders’ true preferences.

Ausubel, Lawrence M. and Oleg V., Baranov (2010) “Core-Selecting Auctions with Incomplete Information,” Working Paper.
Ausubel, Lawrence M. and Paul, Milgrom (2002) “Ascending Auctions with Package Bidding,” Frontiersof Theoretical Economics, 1(1), Article 1.
Ausubel, Lawrence M. and PaulMilgrom (2006) “The Lovely But Lonely Vickrey Auction,” in Peter, Cramton, Yoav, Shoham, and Richard, Steinberg, eds., Combinatorial Auctions, MIT Press.
Day, Robert W. and Peter, Cramton (2012) “The Quadratic Core-Selecting Payment Rule for Combinatorial Auctions,” Operations Research, 60:3 588-603, 2012.
Day Robert, W. and Paul, Milgrom (2008) “Core-Selecting Package Auctions,” International Journalof Game Theory 36, 3–4, 393–407.
Day Robert, W. and Subramanian, Raghavan (2007) “Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions,” Management Science, 53(9), 1389–1406.
Erdil, Aytek and Paul, Klemperer (2010) “A New Payment Rule for Core-selecting Package Auctions,” Journal of the European Economic Association, 8:2–3, April-May, 537–547.
Green, Jerry and Jean-Jacques, Laffont (1977) “Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods,” Econometrica, 45, 427–438.
Gul, Frank and Ennio, Stacchetti (1999) “Walrasian Equilibrium with Gross Substitutes,” Journal ofEconomic Theory, 87, 95–124.
Holmstrom, Begnt (1979) “Groves Schemes on Restricted Domains,” Econometrica, 47, 1137–1144.
Krishna, Vijay and Eliot, Maenner (2001) “Convex potentials with an application to mechanism design,” Econometrica, 69(4), 1113–1119.
Krishna, Vijay and Motty, Perry (1998) “Efficient Mechanism Design,”Working Paper, Pennsylvania State University.
Milgrom, Paul (2000) “Putting Auction Theory toWork: the Simultaneous Ascending Auction,” Journalof Political Economy, 108(2), 245–272.
Milgrom, Paul (2004) Putting Auction Theory to Work, Cambridge University Press.
Myerson, Robert B. and Mark A., Satterthwaite (1983) “Efficient Mechanisms for Bilateral Trading,” Journal of Economic Theory, 29, 265–281.
Williams, Steven R. (1999) “A Characterization of Efficient, Bayesian Incentive Compatible Mechanisms,” Economic Theory, 14, 155–180.