IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v27y2016i2p347-364.html
   My bibliography  Save this article

Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions

Author

Listed:
  • Pallab Sanyal

    (School of Business, George Mason University, Fairfax, Virginia 22030)

Abstract

Jump bidding, which refers to bidding above the minimum necessary, is a robust behavior that has been observed in a variety of ascending auctions in the field as well as the laboratory. However, the phenomenon has yet to be studied in combinatorial auctions, which are a type of multiobject auction that allows bidders to bid on a set of objects. Such auctions have been found to be beneficial when objects exhibit synergy, e.g., are complementary. In this paper, we explore jump bidding behavior in combinatorial auctions as a function of design choices of the mechanism. In particular, we examine the effects of price revelation schemes on the nature and extent of jump bidding. Furthermore, we study the effects of jump bidding on the economic performance of the auctions. To conduct our study, first, we develop hypotheses using auction theories and behavioral theories of how people use reference prices as anchors, and second, we conduct a laboratory experiment to test our hypotheses and examine bidder behavior. We find that the nature of the prices that the auctioneer chooses to offer as feedback to the bidders can considerably influence their jump bidding behavior, leading to significant differences in auction outcomes. We demonstrate that in combinatorial auctions, in addition to the theories of jump bidding proposed in the literature, bounded rationality of the bidders plays a part in the nature and extent of jump bidding. Our study reveals that in the cognitively challenging package-bidding environment, bidders often pursue computationally frugal but suboptimal heuristics. Our results have important policy implications for mechanism designers.

Suggested Citation

  • Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
  • Handle: RePEc:inm:orisre:v:27:y:2016:i:2:p:347-364
    DOI: 10.1287/isre.2016.0624
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/isre.2016.0624
    Download Restriction: no

    File URL: https://libkey.io/10.1287/isre.2016.0624?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. 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.
    2. Shiv, Baba & Edell, Julie A & Payne, John W, 1997. "Factors Affecting the Impact of Negatively and Positively Framed Ad Messages," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 24(3), pages 285-294, December.
    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. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    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. Isaac, R. Mark & Salmon, Timothy C. & Zillante, Arthur, 2007. "A theory of jump bidding in ascending auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 62(1), pages 144-164, January.
    7. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
    8. Gediminas Adomavicius & Alok Gupta, 2005. "Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions," Information Systems Research, INFORMS, vol. 16(2), pages 169-185, June.
    9. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    10. Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
    11. Yaron Raviv, 2008. "The Role Of The Bidding Process In Price Determination: Jump Bidding In Sequential English Auctions," Economic Inquiry, Western Economic Association International, vol. 46(3), pages 325-341, July.
    12. 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.
    13. Christopher Avery, 1998. "Strategic Jump Bidding in English Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 65(2), pages 185-210.
    14. Smith, Vernon L, 1976. "Experimental Economics: Induced Value Theory," American Economic Review, American Economic Association, vol. 66(2), pages 274-279, May.
    15. David Lucking-Reiley, 1999. "Using Field Experiments to Test Equivalence between Auction Formats: Magic on the Internet," American Economic Review, American Economic Association, vol. 89(5), pages 1063-1080, December.
    16. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-75, September.
    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. Karthik Kannan & Vandith Pamuru & Yaroslav Rosokha, 2023. "Analyzing Frictions in Generalized Second-Price Auction Markets," Information Systems Research, INFORMS, vol. 34(4), pages 1437-1454, December.

    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. 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.
    2. Anthony M. Kwasnica & Katerina Sherstyuk, 2013. "Multiunit Auctions," Journal of Economic Surveys, Wiley Blackwell, vol. 27(3), pages 461-490, July.
    3. 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.
    4. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    5. Delnoij, Joyce & Rezaei, Sarah & Rijt, Arnout van de, 2023. "Jump bidding does not reduce prices: Field-experimental evidence from online auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 209(C), pages 308-325.
    6. 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.
    7. 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.
    8. Martin Bichler & Zhen Hao & Gediminas Adomavicius, 2017. "Coalition-Based Pricing in Ascending Combinatorial Auctions," Information Systems Research, INFORMS, vol. 28(1), pages 159-179, March.
    9. 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.
    10. Carpenter, Jeffrey & Holmes, Jessica & Matthews, Peter Hans, 2011. "Jumping and sniping at the silents: Does it matter for charities?," Journal of Public Economics, Elsevier, vol. 95(5), pages 395-402.
    11. David Ettinger & Fabio Michelucci, 2016. "Creating a winner’s curse via jump bids," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 173-186, September.
    12. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    13. 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.
    14. Khoroshilov, Yuri, 2012. "Preemptive bidding in takeover auctions with affiliated values," The Quarterly Review of Economics and Finance, Elsevier, vol. 52(4), pages 395-401.
    15. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    16. 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).
    17. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
    18. 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.
    19. David Grether & David Porter & Matthew Shum, 2011. "Intimidation or Impatience? Jump Bidding in On-line Ascending Automobile Auctions," Working Papers 11-07, Chapman University, Economic Science Institute.
    20. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.

    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:orisre:v:27:y:2016:i:2:p:347-364. 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.