IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v70y2024i11p8187-8215.html
   My bibliography  Save this article

Incentive Auction Design Alternatives: A Simulation Study

Author

Listed:
  • Neil Newman

    (Department of Computer Science, University of British Columbia, Vancouver, British Columbia V6T 1Z4, Canada)

  • Kevin Leyton-Brown

    (Department of Computer Science, University of British Columbia, Vancouver, British Columbia V6T 1Z4, Canada)

  • Paul Milgrom

    (Department of Economics, Stanford University, Stanford, California 94305)

  • Ilya Segal

    (Department of Economics, Stanford University, Stanford, California 94305)

Abstract

This paper revisits the descending clock “reverse” auction design used in the U.S. Federal Communications Commission’s 2016–2017 “incentive auction.” We use extensive computational simulations to investigate the quantitative significance of various aspects of the design, leveraging a reverse auction simulator and realistic models of bidder values.

Suggested Citation

  • Neil Newman & Kevin Leyton-Brown & Paul Milgrom & Ilya Segal, 2024. "Incentive Auction Design Alternatives: A Simulation Study," Management Science, INFORMS, vol. 70(11), pages 8187-8215, November.
    • Handle: RePEc:inm:ormnsc:v:70:y:2024:i:11:p:8187-8215
    DOI: 10.1287/mnsc.2020.02489
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2020.02489
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2020.02489?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Martin Bichler & Zhen Hao & Richard Littmann & Stefan Waldherr, 2020. "Strategyproof auction mechanisms for network procurement," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 965-994, December.
    2. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    3. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    4. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    5. Elena Krasnokutskaya & Katja Seim, 2011. "Bid Preference Programs and Participation in Highway Procurement Auctions," American Economic Review, American Economic Association, vol. 101(6), pages 2653-2686, October.
    6. Richard Engelbrecht-Wiggans & Charles M. Kahn, 2005. "Low-Revenue Equilibria in Simultaneous Ascending-Bid Auctions," Management Science, INFORMS, vol. 51(3), pages 508-518, March.
    7. Gediminas Adomavicius & Shawn P. Curley & Alok Gupta & Pallab Sanyal, 2012. "Effect of Information Feedback on Bidder Behavior in Continuous Combinatorial Auctions," Management Science, INFORMS, vol. 58(4), pages 811-830, April.
    8. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    9. Susan Athey & Jonathan Levin & Enrique Seira, 2011. "Comparing open and Sealed Bid Auctions: Evidence from Timber Auctions," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 126(1), pages 207-257.
    10. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    11. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    12. Paul Milgrom & Ilya Segal, 2020. "Clock Auctions and Radio Spectrum Reallocation," Journal of Political Economy, University of Chicago Press, vol. 128(1), pages 1-31.
    13. Martin Bichler & Vladimir Fux & Jacob K. Goeree, 2019. "Designing combinatorial exchanges for the reallocation of resource rights," Proceedings of the National Academy of Sciences, Proceedings of the National Academy of Sciences, vol. 116(3), pages 786-791, January.
    14. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    15. Caterina Calsamiglia & Chao Fu & Maia Güell, 2020. "Structural Estimation of a Model of School Choices: The Boston Mechanism versus Its Alternatives," Journal of Political Economy, University of Chicago Press, vol. 128(2), pages 642-680.
    16. Timothy N. Cason & Karthik N. Kannan & Ralph Siebert, 2011. "An Experimental Study of Information Revelation Policies in Sequential Auctions," Management Science, INFORMS, vol. 57(4), pages 667-688, April.
    17. Nicolau Santos & Paolo Tubertini & Ana Viana & João Pedro Pedroso, 2017. "Kidney exchange simulation and optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1521-1532, December.
    18. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    19. Back, Kerry & Zender, Jaime F., 2001. "Auctions of divisible goods with endogenous supply," Economics Letters, Elsevier, vol. 73(1), pages 29-34, October.
    20. 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.
    21. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    22. Paulo Somaini, 2020. "Identification in Auction Models with Interdependent Costs," Journal of Political Economy, University of Chicago Press, vol. 128(10), pages 3820-3871.
    23. G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    24. Nikhil Agarwal & Paulo Somaini, 2018. "Demand Analysis Using Strategic Reports: An Application to a School Choice Mechanism," Econometrica, Econometric Society, vol. 86(2), pages 391-444, March.
    25. Jean L. Kiddoo & Evan Kwerel & Sasha Javid & Melissa Dunford & Gary M. Epstein & Charles E. Meisch,Jr. & Karla L. Hoffman & Brian B. Smith & Anthony B. Coudert & Rudy K. Sultana & James A. Costa & Ste, 2019. "Operations Research Enables Auction to Repurpose Television Spectrum for Next-Generation Wireless Technologies," Interfaces, INFORMS, vol. 49(1), pages 7-22, January.
    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. Kevin Leyton-Brown & Paul Milgrom & Neil Newman & Ilya Segal, 2024. "Artificial Intelligence and Market Design: Lessons Learned from Radio Spectrum Reallocation," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
    2. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    3. G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    4. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    5. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    6. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    7. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    8. Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
    9. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    10. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
    11. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    12. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    13. Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.
    14. 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.
    15. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    16. Pickl, Matthias & Wirl, Franz, 2011. "Auction design for gas pipeline transportation capacity--The case of Nabucco and its open season," Energy Policy, Elsevier, vol. 39(4), pages 2143-2151, April.
    17. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    18. Mackenzie, Andrew & Zhou, Yu, 2022. "Menu mechanisms," Journal of Economic Theory, Elsevier, vol. 204(C).
    19. R. H. Kwon & G. Anandalingam & L. H. Ungar, 2005. "Iterative Combinatorial Auctions with Bidder-Determined Combinations," Management Science, INFORMS, vol. 51(3), pages 407-418, March.
    20. Chen, Ning & Ghosh, Arpita & Lambert, Nicolas S., 2014. "Auctions for social lending: A theoretical analysis," Games and Economic Behavior, Elsevier, vol. 86(C), pages 367-391.

    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:inm:ormnsc:v:70:y:2024:i:11:p:8187-8215. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.