IDEAS home Printed from https://ideas.repec.org/a/tpr/jeurec/v8y2010i2-3p537-547.html
   My bibliography  Save this article

A New Payment Rule for Core-Selecting Package Auctions

Author

Listed:
  • Aytek Erdil
  • Paul Klemperer

Abstract

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.

Suggested Citation

  • Aytek Erdil & Paul Klemperer, 2010. "A New Payment Rule for Core-Selecting Package Auctions," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
    • Handle: RePEc:tpr:jeurec:v:8:y:2010:i:2-3:p:537-547
    as

    Download full text from publisher

    File URL: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1542-4774/issues
    File Function: link to full text
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    2. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
    3. 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.
    4. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    5. 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.
    6. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    7. Kalyan Chatterjee & William Samuelson, 1983. "Bargaining under Incomplete Information," Operations Research, INFORMS, vol. 31(5), pages 835-851, October.
    8. 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.
    9. Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
    10. 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.
    11. 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.
    12. Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
    13. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    2. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    3. Benedikt Bünz & Benjamin Lubin & Sven Seuken, 2022. "Designing Core-Selecting Payment Rules: A Computational Search Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1157-1173, December.
    4. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    5. Jeong, Seungwon (Eugene) & Lee, Joosung, 2024. "The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism," Games and Economic Behavior, Elsevier, vol. 143(C), pages 191-203.
    6. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    7. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    8. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    9. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    10. Emiel Maasland & Sander Onderstal, 2006. "Going, Going, Gone! A Swift Tour of Auction Theory and its Applications," De Economist, Springer, vol. 154(2), pages 197-249, June.
    11. , K. & ,, 2016. "On the impossibility of core-selecting auctions," Theoretical Economics, Econometric Society, vol. 11(1), January.
    12. Isa Hafalir & Hadi Yektaş, 2015. "Core deviation minimizing auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 367-376, May.
    13. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    14. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    15. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    16. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    17. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    18. Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 503-510, July.
    19. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    20. Marsden, Richard & Ihle, Hans-Martin, 2018. "Mechanisms to incentivise shared-use of spectrum," Telecommunications Policy, Elsevier, vol. 42(4), pages 315-322.

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Kelly McDougall (email available below). General contact details of provider: https://direct.mit.edu/journals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.