A New Payment Rule for Core-Selecting Package Auctions
We propose a new, easy-to-implement class of payment rules, "Reference Rules" to make core-selecting package auctions more robust. Small, almost-riskless, profitable deviations from "truthful bidding" are often easy for bidders to find under currently used payment rules. Reference Rules perform better than existing rules on our marginal-incentive-to-deviate criterion, and are as robust as existing rules to large deviations. Other considerations, including fairness and comprehensibility, also support the use of Reference Rules. (JEL: D44, C71) (c) 2010 by the European Economic Association.
Volume (Year): 8 (2010)
Issue (Month): 2-3 (04-05)
|Contact details of provider:|| Web page: http://www.mitpressjournals.org/jeea|
|Order Information:||Web: http://www.mitpressjournals.org/jeea|
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.:
- Klemperer, Paul, 2009.
"The Product-Mix Auction: a New Auction Design for Differentiated Goods,"
CEPR Discussion Papers
7395, C.E.P.R. Discussion Papers.
- Paul Klemperer, 2010. "The Product-Mix Auction: A New Auction Design for Differentiated Goods," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 526-536, 04-05.
- Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer, vol. 36(3), pages 393-407, March.
- Peter Cramton, 2013.
"Spectrum Auction Design,"
Review of Industrial Organization,
Springer, vol. 42(2), pages 161-190, March.
- Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2004.
"The Clock-Proxy Auction: A Practical Combinatorial Auction Design,"
Papers of Peter Cramton
04mit5, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Lawrence M. Ausubel & Peter Crampton & Paul Milgrom, 2004. "The Clock-Proxy Auction: A Practical Combinatorial Auction Design," Discussion Papers 03-034, Stanford Institute for Economic Policy Research.
- Myerson, Roger B. & Satterthwaite, Mark A., 1983.
"Efficient mechanisms for bilateral trading,"
Journal of Economic Theory,
Elsevier, vol. 29(2), pages 265-281, April.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005.
"Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords,"
NBER Working Papers
11765, National Bureau of Economic Research, Inc.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
- Robert Day & Peter Cramton, 2008. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Papers of Peter Cramton 08qcspr, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
- Paul Milgrom, 2008.
"Assignment Messages and Exchanges,"
08-014, Stanford Institute for Economic Policy Research.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Ausubel Lawrence M & Milgrom Paul R, 2002.
"Ascending Auctions with Package Bidding,"
The B.E. Journal of Theoretical Economics,
De Gruyter, vol. 1(1), pages 1-44, August.
- Robert W. Day & S. Raghavan, 2007. "Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions," Management Science, INFORMS, vol. 53(9), pages 1389-1406, September.
When requesting a correction, please mention this item's handle: RePEc:tpr:jeurec:v:8:y:2010:i:2-3:p:537-547. 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: (Anna Pollock-Nelson)
If references are entirely missing, you can add them using this form.