IDEAS home Printed from https://ideas.repec.org/a/aea/aejmic/v2y2010i3p160-85.html
   My bibliography  Save this article

Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis

Author

Listed:
  • John H. Kagel
  • Yuanchuan Lien
  • Paul Milgrom

Abstract

We use theory and experiment to explore the performance of multi-round, price-guided, combinatorial auctions. We define efficiency-relevant and core-relevant packages and show that if bidders bid aggressively on these and losing bidders bid to their limits, then the auction leads to efficient or core allocations. We study the theoretically relevant behaviors and hypothesize that subjects will make only a few significant bids, and that certain simulations with auto-bidders will predict variations in performance across different environments. Testing the combinatorial clock auction (CCA) design, we find experimental support for these two hypotheses. We also compare the CCA to a simultaneous ascending auction. (JEL D44)

Suggested Citation

  • John H. Kagel & Yuanchuan Lien & Paul Milgrom, 2010. "Ascending Prices and Package Bidding: A Theoretical and Experimental Analysis," American Economic Journal: Microeconomics, American Economic Association, vol. 2(3), pages 160-185, August.
    • Handle: RePEc:aea:aejmic:v:2:y:2010:i:3:p:160-85
    Note: DOI: 10.1257/mic.2.3.160
    as

    Download full text from publisher

    File URL: http://www.aeaweb.org/articles.php?doi=10.1257/mic.2.3.160
    Download Restriction: no
    File URL: http://www.aeaweb.org/aej/mic/app/2009-0122_app.pdf
    Download Restriction: Access to full text is restricted to AEA members and institutional subscribers.
    ---><---

    References listed on IDEAS

    as
    1. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    2. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    3. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chernomaz, Kirill & Levin, Dan, 2012. "Efficiency and synergy in a multi-unit auction with and without package bidding: An experimental study," Games and Economic Behavior, Elsevier, vol. 76(2), pages 611-635.
    2. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    3. Heczko, Alexander & Kittsteiner, Thomas & Ott, Marion, 2018. "The Performance of Core-Selecting Auctions: An Experiment," EconStor Preprints 176842, ZBW - Leibniz Information Centre for Economics.
    4. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    5. Munro, David R. & Rassenti, Stephen J., 2019. "Combinatorial clock auctions: Price direction and performance," Games and Economic Behavior, Elsevier, vol. 117(C), pages 195-217.
    6. Bierbrauer, Felix & Ockenfels, Axel & Pollak, Andreas & Rückert, Désirée, 2017. "Robust mechanism design and social preferences," Journal of Public Economics, Elsevier, vol. 149(C), pages 59-80.
    7. Eric Budish & Judd B. Kessler, 2016. "Can Market Participants Report their Preferences Accurately (Enough)?," NBER Working Papers 22448, National Bureau of Economic Research, Inc.
    8. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    9. Sano, Ryuji, 2012. "Non-bidding equilibrium in an ascending core-selecting auction," Games and Economic Behavior, Elsevier, vol. 74(2), pages 637-650.
    10. Bernhard Kasberger & Alexander Teytelboym, 2022. "The Combinatorial Multi-Round Ascending Auction," Papers 2203.11783, arXiv.org, revised Feb 2024.
    11. Kagel, John H. & Lien, Yuanchuan & Milgrom, Paul, 2014. "Ascending prices and package bidding: Further experimental analysis," Games and Economic Behavior, Elsevier, vol. 85(C), pages 210-231.
    12. Daniel Marszalec, 2016. "Auctions For Complements –An Experimental Analysis," CIRJE F-Series CIRJE-F-1018, CIRJE, Faculty of Economics, University of Tokyo.
    13. 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.
    14. Tobias Scheffel & Georg Ziegler & Martin Bichler, 2012. "On the impact of package selection in combinatorial auctions: an experimental study in the context of spectrum auction design," Experimental Economics, Springer;Economic Science Association, vol. 15(4), pages 667-692, December.
    15. 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.
    16. Bart Vangerven & Dries R. Goossens & Frits C. R. Spieksma, 2021. "Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 63(2), pages 113-127, 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. Hinloopen, Jeroen & Onderstal, Sander, 2014. "Going once, going twice, reported! Cartel activity and the effectiveness of antitrust policies in experimental auctions," European Economic Review, Elsevier, vol. 70(C), pages 317-336.
    19. Péter Biró & Gyula Magyarkuti, 2021. "The Work of Milgrom and Wilson in the Theory and Practical Application of Auctions," Financial and Economic Review, Magyar Nemzeti Bank (Central Bank of Hungary), vol. 20(1), pages 127-151.
    20. Marszalec, Daniel, 2018. "Fear not the simplicity - An experimental analysis of auctions for complements," Journal of Economic Behavior & Organization, Elsevier, vol. 152(C), pages 81-97.
    21. 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.

    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. Martin Bichler & Pasha Shabalin & Jürgen Wolf, 2013. "Do core-selecting Combinatorial Clock Auctions always lead to high efficiency? An experimental analysis of spectrum auction designs," Experimental Economics, Springer;Economic Science Association, vol. 16(4), pages 511-545, December.
    2. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    3. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
    4. 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.
    5. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    6. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2010. "Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 1-13, February.
    7. Eiichiro Kazumori, 2010. "Core-Selecting Auctions: An Experimental Study," CARF F-Series CARF-F-226, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    8. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    9. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    10. Andrea Attar & Thomas Mariotti & François Salanié, 2021. "Entry-Proofness and Discriminatory Pricing under Adverse Selection," American Economic Review, American Economic Association, vol. 111(8), pages 2623-2659, August.
    11. Hongpeng Guo & Zhihao Lv & Junyi Hua & Hongxu Yuan & Qingyu Yu, 2021. "Design of Combined Auction Model for Emission Rights of International Forestry Carbon Sequestration and Other Pollutants Based on SMRA," Sustainability, MDPI, vol. 13(20), pages 1-18, October.
    12. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Lawrence M. Ausubel & Paul Milgrom, 2004. "The Lovely but Lonely Vickrey Auction," Discussion Papers 03-036, Stanford Institute for Economic Policy Research.
    14. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 10acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    15. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    16. Christian Kroemer & Martin Bichler & Andor Goetzendorff, 2016. "(Un)expected Bidder Behavior in Spectrum Auctions: About Inconsistent Bidding and Its Impact on Efficiency in the Combinatorial Clock Auction," Group Decision and Negotiation, Springer, vol. 25(1), pages 31-63, January.
    17. 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.
    18. Parag A. Pathak & Alex Rees-Jones & Tayfun Sönmez, 2020. "Immigration Lottery Design: Engineered and Coincidental Consequences of H-1B Reforms," NBER Working Papers 26767, National Bureau of Economic Research, Inc.
    19. Nicolas Gruyer & Nathalie Lenoir, 2003. "Auctioning airport slots (?)," Post-Print hal-01021718, HAL.
    20. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.

    More about this item

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:aea:aejmic:v:2:y:2010:i:3:p:160-85. 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: Michael P. Albert (email available below). General contact details of provider: https://edirc.repec.org/data/aeaaaea.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.