IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v202y2010i2p574-583.html
   My bibliography  Save this article

Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations

Author

Listed:
  • Pinker, Edieal
  • Seidmann, Abraham
  • Vakrat, Yaniv

Abstract

Internet auctions for consumers' goods are an increasingly popular selling venue. We have observed that many sellers, instead of offering their entire inventory in a single auction, split it into sequential auctions of smaller lots, thereby reducing the negative market impact of larger lots. Information technology also makes it possible to collect and analyze detailed bid data from online auctions. In this paper, we develop and test a new model of sequential online auctions to explore the potential benefits of using real bid data from earlier auctions to improve the management of future auctions. Assuming a typical truth-revealing auction model, we quantify the effect of the lot size on the closing price and derive a closed-form solution for the problem of allocating inventory across multiple auctions when bidder valuation distributions are known. We also develop a decision methodology for allocating inventory across multiple auctions that dynamically incorporates the results of previous auctions as feedback into the management of subsequent auctions, and updating the lot size and number of auctions. We demonstrate how information signals from previous auctions can be used to update the auctioneer's beliefs about the customers' valuation distribution, and then to significantly increase the seller's profit potential. We use several examples to reveal the benefits of using detailed transaction data for the management of sequential, multi-unit, online auctions and we demonstrate how these benefits are influenced by the inventory holding costs, the number of bidders, and the dispersion of consumers' valuations.

Suggested Citation

  • Pinker, Edieal & Seidmann, Abraham & Vakrat, Yaniv, 2010. "Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations," European Journal of Operational Research, Elsevier, vol. 202(2), pages 574-583, April.
  • Handle: RePEc:eee:ejores:v:202:y:2010:i:2:p:574-583
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00359-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. William S. Lovejoy, 1990. "Myopic Policies for Some Inventory Models with Uncertain Demand Distributions," Management Science, INFORMS, vol. 36(6), pages 724-738, June.
    2. Katy S. Azoury, 1985. "Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution," Management Science, INFORMS, vol. 31(9), pages 1150-1160, September.
    3. Guillermo Gallego & Garrett van Ryzin, 1994. "Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons," Management Science, INFORMS, vol. 40(8), pages 999-1020, August.
    4. Wang, Ruqu, 1993. "Auctions versus Posted-Price Selling," American Economic Review, American Economic Association, vol. 83(4), pages 838-851, September.
    5. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
    6. Hila Etzion & Edieal Pinker & Abraham Seidmann, 2006. "Analyzing the Simultaneous Use of Auctions and Posted Prices for Online Selling," Manufacturing & Service Operations Management, INFORMS, vol. 8(1), pages 68-91, March.
    7. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721.
    8. Robert F. Easley & Rafael Tenorio, 2004. "Jump Bidding Strategies in Internet Auctions," Management Science, INFORMS, vol. 50(10), pages 1407-1419, October.
    9. Harris, Milton & Raviv, Artur, 1981. "Allocation Mechanisms and the Design of Auctions," Econometrica, Econometric Society, vol. 49(6), pages 1477-1499, November.
    10. Daniel Houser & John Wooders, 2005. "Hard and Soft Closes: A Field Experiment on Auction Closing Rules," Springer Books, in: Amnon Rapoport & Rami Zwick (ed.), Experimental Business Research, chapter 0, pages 123-131, Springer.
    11. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    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. Wang, Hong, 2017. "Analysis and design for multi-unit online auctions," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1191-1203.
    2. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
    3. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    4. McLaughlin, Christopher & McCauley, Laura Bradley & Prentice, Garry & Verner, Emma-Jayne & Loane, Sharon, 2020. "Gender differences using online auctions within a generation Y sample: An application of the Theory of Planned Behaviour," Journal of Retailing and Consumer Services, Elsevier, vol. 56(C).
    5. Jason Kuruzovich & Siva Viswanathan & Ritu Agarwal, 2010. "Seller Search and Market Outcomes in Online Auctions," Management Science, INFORMS, vol. 56(10), pages 1702-1717, October.
    6. Jason Kuruzovich & Hila Etzion, 2018. "Online Auctions and Multichannel Retailing," Management Science, INFORMS, vol. 64(6), pages 2734-2753, June.
    7. Yu Ning & Su Xiu Xu & George Q. Huang & Xudong Lin, 2021. "Optimal digital product auctions with unlimited supply and rebidding behavior," Annals of Operations Research, Springer, vol. 307(1), pages 399-416, December.
    8. Seokjoo Andrew Chang, 2012. "Time dynamics of overlapping e-auction mechanisms: Information transfer, strategic user behavior and auction revenue," Information Systems Frontiers, Springer, vol. 14(2), pages 331-342, April.
    9. Chen, Xi & Ghate, Archis & Tripathi, Arvind, 2011. "Dynamic lot-sizing in sequential online retail auctions," European Journal of Operational Research, Elsevier, vol. 215(1), pages 257-267, November.
    10. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    11. Schellhorn, Henry, 2011. "A trading mechanism contingent on several indices," European Journal of Operational Research, Elsevier, vol. 213(3), pages 551-558, September.
    12. Kostas Bimpikis & Wedad J. Elmaghraby & Ken Moon & Wenchang Zhang, 2020. "Managing Market Thickness in Online Business-to-Business Markets," Management Science, INFORMS, vol. 66(12), pages 5783-5822, December.
    13. Katehakis, Michael N. & Puranam, Kartikeya S., 2012. "On bidding for a fixed number of items in a sequence of auctions," European Journal of Operational Research, Elsevier, vol. 222(1), pages 76-84.
    14. Jiang, Zhong-Zhong & Fang, Shu-Cherng & Fan, Zhi-Ping & Wang, Dingwei, 2013. "Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers," European Journal of Operational Research, Elsevier, vol. 226(1), pages 139-153.
    15. Yixin Lu & Alok Gupta & Wolfgang Ketter & Eric van Heck, 2019. "Dynamic Decision Making in Sequential Business-to-Business Auctions: A Structural Econometric Approach," Management Science, INFORMS, vol. 65(8), pages 3853-3876, August.

    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. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
    2. Apostolos Burnetas & Stephen Gilbert, 2001. "Future Capacity Procurements Under Unknown Demand and Increasing Costs," Management Science, INFORMS, vol. 47(7), pages 979-992, July.
    3. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    4. Hummel, Patrick, 2015. "Simultaneous use of auctions and posted prices," European Economic Review, Elsevier, vol. 78(C), pages 269-284.
    5. Ernan Haruvy & Peter Popkowski Leszczyc & Octavian Carare & James Cox & Eric Greenleaf & Wolfgang Jank & Sandy Jap & Young-Hoon Park & Michael Rothkopf, 2008. "Competition between auctions," Marketing Letters, Springer, vol. 19(3), pages 431-448, December.
    6. Gershkov, Alex & Moldovanu, Benny, 2012. "Dynamic allocation and pricing: A mechanism design approach," International Journal of Industrial Organization, Elsevier, vol. 30(3), pages 283-286.
    7. Sun, Daewon & Li, Erick & Hayya, Jack C., 2010. "The optimal format to sell a product through the internet: Posted price, auction, and buy-price auction," International Journal of Production Economics, Elsevier, vol. 127(1), pages 147-157, September.
    8. Edieal J. Pinker & Abraham Seidmann & Yaniv Vakrat, 2003. "Managing Online Auctions: Current Business and Research Issues," Management Science, INFORMS, vol. 49(11), pages 1457-1484, November.
    9. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    10. Jiang, Zhong-Zhong & Fang, Shu-Cherng & Fan, Zhi-Ping & Wang, Dingwei, 2013. "Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers," European Journal of Operational Research, Elsevier, vol. 226(1), pages 139-153.
    11. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-1575, September.
    12. Jeremy Bulow & Paul Klemperer, 2009. "Why Do Sellers (Usually) Prefer Auctions?," American Economic Review, American Economic Association, vol. 99(4), pages 1544-75, September.

    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:eee:ejores:v:202:y:2010:i:2:p:574-583. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.