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

Dynamic lot-sizing in sequential online retail auctions

Author

Listed:
  • Chen, Xi
  • Ghate, Archis
  • Tripathi, Arvind

Abstract

Retailers often conduct non-overlapping sequential online auctions as a revenue generation and inventory clearing tool. We build a stochastic dynamic programming model for the seller's lot-size decision problem in these auctions. The model incorporates a random number of participating bidders in each auction, allows for any bid distribution, and is not restricted to any specific price-determination mechanism. Using stochastic monotonicity/stochastic concavity and supermodularity arguments, we present a complete structural characterization of optimal lot-sizing policies under a second order condition on the single-auction expected revenue function. We show that a monotone staircase with unit jumps policy is optimal and provide a simple inequality to determine the locations of these staircase jumps. Our analytical examples demonstrate that the second order condition is met in common online auction mechanisms. We also present numerical experiments and sensitivity analyses using real online auction data.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:215:y:2011:i:1:p:257-267
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711004991
    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. Ravi Bapna & Paulo Goes & Alok Gupta, 2003. "Analysis and Design of Business-to-Consumer Online Auctions," Management Science, INFORMS, vol. 49(1), pages 85-101, January.
    2. Paul Resnick & Richard Zeckhauser & John Swanson & Kate Lockwood, 2006. "The value of reputation on eBay: A controlled experiment," Experimental Economics, Springer;Economic Science Association, vol. 9(2), pages 79-101, June.
    3. Paulo B. Goes & Gilbert G. Karuga & Arvind K. Tripathi, 2010. "Understanding Willingness-to-Pay Formation of Repeat Bidders in Sequential Online Auctions," Information Systems Research, INFORMS, vol. 21(4), pages 907-924, December.
    4. 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.
    5. Garrett van Ryzin & Gustavo Vulcano, 2004. "Optimal Auctioning and Ordering in an Infinite Horizon Inventory-Pricing System," Operations Research, INFORMS, vol. 52(3), pages 346-367, June.
    6. 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.
    7. 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.
    8. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. "Circumventing the Slater conundrum in countably infinite linear programs," European Journal of Operational Research, Elsevier, vol. 246(3), pages 708-720.
    3. 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.
    4. 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.
    5. Xu, Haoxuan & Gong, Yeming (Yale) & Chu, Chengbin & Zhang, Jinlong, 2017. "Dynamic lot-sizing models for retailers with online channels," International Journal of Production Economics, Elsevier, vol. 183(PA), pages 171-184.
    6. Guo, Peijun & Li, Yonggang, 2014. "Approaches to multistage one-shot decision making," European Journal of Operational Research, Elsevier, vol. 236(2), pages 612-623.
    7. Bakker, Hannah & Dunke, Fabian & Nickel, Stefan, 2020. "A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice," Omega, Elsevier, vol. 96(C).
    8. Kartikeya Puranam & Michael Katehakis, 2014. "On optimal bidding and inventory control in sequential procurement auctions: the multi period case," Annals of Operations Research, Springer, vol. 217(1), pages 447-462, June.
    9. 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.
    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. 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. 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.
    3. 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.
    4. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    5. Wang, Hong, 2017. "Analysis and design for multi-unit online auctions," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1191-1203.
    6. Woonghee Tim Huh & Ganesh Janakiraman, 2008. "Inventory Management with Auctions and Other Sales Channels: Optimality of (s, S) Policies," Management Science, INFORMS, vol. 54(1), pages 139-150, January.
    7. 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.
    8. Vidyanand Choudhary & Shivendu Shivendu, 2017. "Targeted Couponing in Online Auctions," Information Systems Research, INFORMS, vol. 28(3), pages 490-510, September.
    9. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    10. Jason Kuruzovich & Hila Etzion, 2018. "Online Auctions and Multichannel Retailing," Management Science, INFORMS, vol. 64(6), pages 2734-2753, June.
    11. Ødegaard, Fredrik & Anderson, Chris K., 2014. "All-pay auctions with pre- and post-bidding options," European Journal of Operational Research, Elsevier, vol. 239(2), pages 579-592.
    12. Hummel, Patrick, 2015. "Simultaneous use of auctions and posted prices," European Economic Review, Elsevier, vol. 78(C), pages 269-284.
    13. 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.
    14. Kevin Hasker & Robin Sickles, 2010. "eBay in the Economic Literature: Analysis of an Auction Marketplace," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 37(1), pages 3-42, August.
    15. Patrick Hummel, 2018. "How do selling mechanisms affect profits, surplus, capacity and prices with unknown demand?," Canadian Journal of Economics/Revue canadienne d'économique, John Wiley & Sons, vol. 51(1), pages 94-126, February.
    16. 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.
    17. Liu, Shuren & Liu, Changgeng & Hu, Qiying, 2013. "Optimal procurement strategies by reverse auctions with stochastic demand," Economic Modelling, Elsevier, vol. 35(C), pages 430-435.
    18. 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.
    19. Sun, Daewon, 2008. "Dual mechanism for an online retailer," European Journal of Operational Research, Elsevier, vol. 187(3), pages 903-921, June.
    20. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.

    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:215:y:2011:i:1:p:257-267. 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.