IDEAS home Printed from https://ideas.repec.org/a/eee/ecmode/v35y2013icp430-435.html
   My bibliography  Save this article

Optimal procurement strategies by reverse auctions with stochastic demand

Author

Listed:
  • Liu, Shuren
  • Liu, Changgeng
  • Hu, Qiying

Abstract

This paper studies a dynamic procurement problem by reverse auction for a retailer with stochastic demand. In each period, the retailer based on his inventory needs to determine a payment function (a procurement contract) according to which a number of potential suppliers compete in the reverse auction. We show the existence of the retailer's optimal payment function and find that the suppliers' Bayesian–Nash equilibrium bidding strategy is similar to the base-stock policy in the traditional multi-period inventory control problems when the retailer incurs no fixed setup cost, while similar to the (s, S) policy when the retailer incurs a fixed setup cost. This strategy is for the suppliers, instead of for the retailer, depends on the supplier's marginal cost and so is stochastic for the retailer. Thus, this paper extends well beyond traditional procurement environments studied so far in the inventory control literature.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ecmode:v:35:y:2013:i:c:p:430-435
    DOI: 10.1016/j.econmod.2013.07.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0264999313003040
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econmod.2013.07.033?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
    ---><---

    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. Suresh P. Sethi & Feng Cheng, 1997. "Optimality of ( s , S ) Policies in Inventory Models with Markovian Demand," Operations Research, INFORMS, vol. 45(6), pages 931-939, December.
    2. Peter Berling & Victor Martínez-de-Albéniz, 2011. "Optimal Inventory Policies when Purchase Price and Demand Are Stochastic," Operations Research, INFORMS, vol. 59(1), pages 109-124, February.
    3. Evan L. Porteus, 1971. "On the Optimality of Generalized (s, S) Policies," Management Science, INFORMS, vol. 17(7), pages 411-426, March.
    4. Tunay I. Tunca & Qiong Wu, 2009. "Multiple Sourcing and Procurement Process Selection with Bidding Events," Management Science, INFORMS, vol. 55(5), pages 763-780, May.
    5. Fangruo Chen, 2007. "Auctioning Supply Contracts," Management Science, INFORMS, vol. 53(10), pages 1562-1576, October.
    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. 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.
    8. Zhixi Wan & Damian R. Beil, 2009. "RFQ Auctions with Supplier Qualification Screening," Post-Print hal-00471441, HAL.
    9. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    10. 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. Shilei Wang & Ying Ji & M. I. M. Wahab & Dan Xu & Changbao Zhou, 2022. "A New Decision Framework of Online Multi-Attribute Reverse Auctions for Green Supplier Selection under Mixed Uncertainty," Sustainability, MDPI, vol. 14(24), pages 1-23, December.
    2. He, Chusu & Milne, Alistair & Ataullah, Ali, 2023. "What explains delays in public procurement decisions?," Economic Modelling, Elsevier, vol. 121(C).

    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. 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.
    2. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    3. Jason Shachat & Lijia Tan, 2015. "An Experimental Investigation of Auctions and Bargaining in Procurement," Management Science, INFORMS, vol. 61(5), pages 1036-1051, May.
    4. Ying-Ju Chen & Gustavo Vulcano, 2009. "Effects of Information Disclosure Under First- and Second-Price Auctions in a Supply Chain Setting," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 299-316, September.
    5. Budde, Maximilian & Minner, Stefan, 2014. "First- and second-price sealed-bid auctions applied to push and pull supply contracts," European Journal of Operational Research, Elsevier, vol. 237(1), pages 370-382.
    6. Aadhaar Chaturvedi & Damian R. Beil & Victor Martínez-de-Albéniz, 2014. "Split-Award Auctions for Supplier Retention," Management Science, INFORMS, vol. 60(7), pages 1719-1737, July.
    7. 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.
    8. 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.
    9. Bin Hu & Anyan Qi, 2018. "Optimal Procurement Mechanisms for Assembly," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 655-666, October.
    10. Aadhaar Chaturvedi & Victor Martínez-de-Albéniz, 2011. "Optimal Procurement Design in the Presence of Supply Risk," Manufacturing & Service Operations Management, INFORMS, vol. 13(2), pages 227-243, May.
    11. Aadhaar Chaturvedi & Elena Katok & Damian R. Beil, 2019. "Split-Award Auctions: Insights from Theory and Experiments," Management Science, INFORMS, vol. 65(1), pages 71-89, January.
    12. Damian R. Beil & Qi (George) Chen & Izak Duenyas & Brendan D. See, 2018. "When to Deploy Test Auctions in Sourcing," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 232-248, May.
    13. 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.
    14. Philippe Choné & Laurent Linnemer & Thibaud Vergé, 2021. "Double Marginalization and Vertical Integration," CESifo Working Paper Series 8971, CESifo.
    15. Sun, Daewon, 2008. "Dual mechanism for an online retailer," European Journal of Operational Research, Elsevier, vol. 187(3), pages 903-921, June.
    16. 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.
    17. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    18. Said, Maher, 2012. "Auctions with dynamic populations: Efficiency and revenue maximization," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2419-2438.
    19. Jose Alcalde & Matthias Dahm, 2016. "Proportional payoffs in legislative bargaining with weighted voting: a characterization," Discussion Papers 2016-03, The Centre for Decision Research and Experimental Economics, School of Economics, University of Nottingham.
    20. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.

    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:ecmode:v:35:y:2013:i:c:p:430-435. 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/inca/30411 .

    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.