IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v20y2018i3p566-582.html
   My bibliography  Save this article

Optimal Procurement Auctions Under Multistage Supplier Qualification

Author

Listed:
  • Wei Chen

    (School of Business, University of Kansas, Lawrence, Kansas 66045)

  • Milind Dawande

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Ganesh Janakiraman

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

Abstract

We consider a firm that solicits bids from a fixed-sized pool of yet-to-be-qualified suppliers for an indivisible contract. The contract can only be awarded to a supplier who passes a multistage qualification process. For each stage of the qualification process, the buyer incurs a fixed testing cost for each supplier she chooses to test. The buyer seeks an optimal mechanism—that is, one that minimizes her total expected cost. Motivated by the buyer’s urgency (or the lack of it) of time for completing the qualification process, we obtain optimal mechanisms for two testing environments: (1) simultaneous testing, where in each stage, the buyer selects a subset of those suppliers who have passed all the previous stages and tests them simultaneously; and (2) nonsimultaneous testing, where the simultaneous-testing requirement is not imposed. Under simultaneous testing, the admission policy for selecting suppliers at each stage is based on nonuniform reserve-price thresholds. Under nonsimultaneous testing, too, the admission policy is threshold based, but the selection process is sequential in nature. The relative increase in cost due to the simultaneous-testing requirement is (under a mild condition) monotonically increasing in the number of suppliers, the expected multistage testing cost, and the overall passing probability. We also study the optimal sequencing of the qualification stages and show that the buyer should schedule the stages in increasing order of the ratio of their testing cost to their failing probability. Finally, for the simpler setting of a single-stage qualification process and a single supplier, we study a two-dimensional mechanism design problem where, in addition to cost, the passing probability is also private to the supplier. Here, too, threshold-based admission remains optimal, and the buyer offers either a pooling or a separating contract.

Suggested Citation

  • Wei Chen & Milind Dawande & Ganesh Janakiraman, 2018. "Optimal Procurement Auctions Under Multistage Supplier Qualification," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 566-582, July.
  • Handle: RePEc:inm:ormsom:v:20:y:2018:i:3:p:566-582
    DOI: 10.1287/msom.2017.0664
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/msom.2017.0664
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2017.0664?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. Bester, Helmut & Strausz, Roland, 2000. "Imperfect commitment and the revelation principle: the multi-agent case," Economics Letters, Elsevier, vol. 69(2), pages 165-171, November.
    2. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    3. Bester, Helmut & Strausz, Roland, 2001. "Contracting with Imperfect Commitment and the Revelation Principle: The Single Agent Case," Econometrica, Econometric Society, vol. 69(4), pages 1077-1098, July.
    4. Alexandre Belloni & Giuseppe Lopomo & Shouqiang Wang, 2010. "Multidimensional Mechanism Design: Finite-Dimensional Approximations and Efficient Computation," Operations Research, INFORMS, vol. 58(4-part-2), pages 1079-1089, August.
    5. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    6. Pinar Keskinocak & Shidhar Tayur, 2001. "Quantitative Analysis for Internet-Enabled Supply Chains," Interfaces, INFORMS, vol. 31(2), pages 70-89, April.
    7. Zhixi Wan & Damian R. Beil, 2009. "RFQ Auctions with Supplier Qualification Screening," Post-Print hal-00471441, HAL.
    8. Wedad J. Elmaghraby, 2000. "Supply Contract Competition and Sourcing Policies," Manufacturing & Service Operations Management, INFORMS, vol. 2(4), pages 350-371, April.
    9. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    10. Alessandro Pavan & Ilya Segal & Juuso Toikka, 2014. "Dynamic Mechanism Design: A Myersonian Approach," Econometrica, Econometric Society, vol. 82(2), pages 601-653, March.
    11. Armstrong, Mark & Rochet, Jean-Charles, 1999. "Multi-dimensional screening:: A user's guide," European Economic Review, Elsevier, vol. 43(4-6), pages 959-979, April.
    12. Richard Butterworth, 1972. "Some Reliability Fault-Testing Models," Operations Research, INFORMS, vol. 20(2), pages 335-343, April.
    13. Zhixi Wan & Damian R. Beil & Elena Katok, 2012. "When Does It Pay to Delay Supplier Qualification? Theory and Experiments," Management Science, INFORMS, vol. 58(11), pages 2057-2075, November.
    14. 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.
    15. 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.
    16. Zhixi Wan & Damian R. Beil, 2009. "RFQ Auctions with Supplier Qualification Screening," Operations Research, INFORMS, vol. 57(4), pages 934-949, August.
    17. Dimitri,Nicola & Piga,Gustavo & Spagnolo,Giancarlo (ed.), 2006. "Handbook of Procurement," Cambridge Books, Cambridge University Press, number 9780521870733, October.
    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. Karca D. Aral & Damian R. Beil & Luk N. Van Wassenhove, 2021. "Supplier Sustainability Assessments in Total‐Cost Auctions," Production and Operations Management, Production and Operations Management Society, vol. 30(4), pages 902-920, April.
    2. Gediminas Adomavicius & Shawn P. Curley & Alok Gupta & Pallab Sanyal, 2020. "How Decision Complexity Affects Outcomes in Combinatorial Auctions," Production and Operations Management, Production and Operations Management Society, vol. 29(11), pages 2579-2600, November.

    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. 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.
    2. Bin Hu & Anyan Qi, 2018. "Optimal Procurement Mechanisms for Assembly," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 655-666, October.
    3. Fugger, Nicolas & Gretschko, Vitali & Pollrich, Martin, 2019. "Sequential procurement with limited commitment," ZEW Discussion Papers 19-030, ZEW - Leibniz Centre for European Economic Research.
    4. Yonatan Gur & Gregory Macnamara & Daniela Saban, 2022. "Sequential Procurement with Contractual and Experimental Learning," Management Science, INFORMS, vol. 68(4), pages 2714-2731, April.
    5. Jason Shachat & Lijia Tan, 2015. "An Experimental Investigation of Auctions and Bargaining in Procurement," Management Science, INFORMS, vol. 61(5), pages 1036-1051, May.
    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. Zhixi Wan & Damian R. Beil & Elena Katok, 2012. "When Does It Pay to Delay Supplier Qualification? Theory and Experiments," Management Science, INFORMS, vol. 58(11), pages 2057-2075, November.
    8. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    9. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    10. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    11. Alexey Kushnir & James Michelson, 2022. "Optimal Multi-Dimensional Auctions: Conjectures and Simulations," Papers 2207.01664, arXiv.org.
    12. Jean Tirole, 2016. "From Bottom of the Barrel to Cream of the Crop: Sequential Screening With Positive Selection," Econometrica, Econometric Society, vol. 84(4), pages 1291-1343, July.
    13. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    14. Yeon-Koo Che & Elisabetta Iossa & Patrick Rey, 2021. "Prizes versus Contracts as Incentives for Innovation [Subgame Perfect Implementation Under Information Perturbations]," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 88(5), pages 2149-2178.
    15. Skreta, Vasiliki, 2015. "Optimal auction design under non-commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 854-890.
    16. Bergemann, Dirk & Strack, Philipp, 2022. "Progressive participation," Theoretical Economics, Econometric Society, vol. 17(3), July.
    17. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    18. Golosov, M. & Tsyvinski, A. & Werquin, N., 2016. "Recursive Contracts and Endogenously Incomplete Markets," Handbook of Macroeconomics, in: J. B. Taylor & Harald Uhlig (ed.), Handbook of Macroeconomics, edition 1, volume 2, chapter 0, pages 725-841, Elsevier.
    19. Philippe Gillen & Vitali Gretschko & Alexander Rasch, 2017. "Pre-auction or post-auction qualification?," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 5(2), pages 139-150, October.
    20. Zhixi Wan & Damian R. Beil, 2009. "RFQ Auctions with Supplier Qualification Screening," Operations Research, INFORMS, vol. 57(4), pages 934-949, August.

    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:ormsom:v:20:y:2018:i:3:p:566-582. 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.