IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v49y2003i11p1529-1545.html
   My bibliography  Save this article

An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process

Author

Listed:
  • Damian R. Beil

    (University of Michigan Business School, Ann Arbor, Michigan 48109-1234)

  • Lawrence M. Wein

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

Abstract

We consider a manufacturer who uses a reverse, or procurement, auction to determine which supplier will be awarded a contract. Each bid consists of a price and a set of nonprice attributes (e.g., quality, lead time). The manufacturer is assumed to know the parametric form of the suppliers' cost functions (in terms of the nonprice attributes), but has no prior information on the parameter values. We construct a multiround open-ascending auction mechanism, where the manufacturer announces a slightly different scoring rule (i.e., a function that ranks the bids in terms of the price and nonprice attributes) in each round. Via inverse optimization, the manufacturer uses the bids from the first several rounds to learn the suppliers' cost functions, and then in the final round chooses a scoring rule that attempts to maximize his own utility. Under the assumption that suppliers submit their myopic best-response bids in the last round, and do not distort their bids in the earlier rounds (i.e., they choose their minimum-cost bid to achieve any given score), our mechanism, indeed, maximizes the manufacturer's utility within the open-ascending format. We also discuss several enhancements that improve the robustness of our mechanism with respect to the model's informational and behavioral assumptions.

Suggested Citation

  • Damian R. Beil & Lawrence M. Wein, 2003. "An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process," Management Science, INFORMS, vol. 49(11), pages 1529-1545, November.
  • Handle: RePEc:inm:ormnsc:v:49:y:2003:i:11:p:1529-1545
    DOI: 10.1287/mnsc.49.11.1529.20588
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.49.11.1529.20588
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.49.11.1529.20588?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. Fudenberg, Drew & Levine, David, 1998. "Learning in games," European Economic Review, Elsevier, vol. 42(3-5), pages 631-639, May.
    2. Yeon-Koo Che, 1993. "Design Competition through Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 24(4), pages 668-680, Winter.
    3. Fernando Branco, 1997. "The Design of Multidimensional Auctions," RAND Journal of Economics, The RAND Corporation, vol. 28(1), pages 63-81, Spring.
    4. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    5. Peter Cramton & John McMillan & Paul Milgrom & Bradley Miller & Bridger Mitchell & Daniel Vincent & Robert Wilson, 1998. "Simultaneous Ascending Auctions with Package Bidding," Papers of Peter Cramton 98cra2, University of Maryland, Department of Economics - Peter Cramton.
    6. Cramton, Peter, 1998. "Ascending auctions," European Economic Review, Elsevier, vol. 42(3-5), pages 745-756, May.
    7. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    8. Drew Fudenberg & David K. Levine, 1998. "The Theory of Learning in Games," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061945, April.
    9. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    Full references (including those not matched with items on IDEAS)

    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. Jérémie Gallien & Lawrence M. Wein, 2005. "A Smart Market for Industrial Procurement with Capacity Constraints," Management Science, INFORMS, vol. 51(1), pages 76-91, January.
    2. Ching-Hua Chen-Ritzo & Terry P. Harrison & Anthony M. Kwasnica & Douglas J. Thomas, 2005. "Better, Faster, Cheaper: An Experimental Analysis of a Multiattribute Reverse Auction Mechanism with Restricted Information Feedback," Management Science, INFORMS, vol. 51(12), pages 1753-1762, December.
    3. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.
    4. Bogetoft, Peter & Nielsen, Kurt, 2003. "Yardstick Based Procurement Design In Natural Resource Management," 2003 Annual Meeting, August 16-22, 2003, Durban, South Africa 25910, International Association of Agricultural Economists.
    5. ,, 2011. "Manipulative auction design," Theoretical Economics, Econometric Society, vol. 6(2), May.
    6. Peter Postl, 2013. "Efficiency versus optimality in procurement," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(2), pages 425-472, June.
    7. Jan Boone & Christoph Schottmüller, 2016. "Procurement with specialized firms," RAND Journal of Economics, RAND Corporation, vol. 47(3), pages 661-687, August.
    8. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
    9. Roberto Burguet & Martin K. Perry, 2009. "Preferred suppliers in auction markets," RAND Journal of Economics, RAND Corporation, vol. 40(2), pages 283-295, June.
    10. Laurent Lamy, 2013. "“Upping the ante”: how to design efficient auctions with entry?," RAND Journal of Economics, RAND Corporation, vol. 44(2), pages 194-214, June.
    11. Guido Tatone, 2018. "La reputazione negli appalti pubblici: uno strumento socialmente desiderabile per risolvere il problema dello scadimento qualitativo," ECONOMIA PUBBLICA, FrancoAngeli Editore, vol. 2018(1), pages 59-85.
    12. Roberto Burguet, 2000. "Auction theory: a guided tour," Investigaciones Economicas, Fundación SEPI, vol. 24(1), pages 3-50, January.
    13. Dimitris Kostamis & Damian R. Beil & Izak Duenyas, 2009. "Total-Cost Procurement Auctions: Impact of Suppliers' Cost Adjustments on Auction Format Choice," Management Science, INFORMS, vol. 55(12), pages 1985-1999, December.
    14. Zhixi Wan & Damian R. Beil, 2009. "RFQ Auctions with Supplier Qualification Screening," Operations Research, INFORMS, vol. 57(4), pages 934-949, August.
    15. Fangruo Chen, 2007. "Auctioning Supply Contracts," Management Science, INFORMS, vol. 53(10), pages 1562-1576, October.
    16. Seung Han Yoo, 2017. "Optimal Design for an Informed Auctioneer," Discussion Paper Series 1702, Institute of Economic Research, Korea University.
    17. Li, Yunan, 2017. "Approximation in mechanism design with interdependent values," Games and Economic Behavior, Elsevier, vol. 103(C), pages 225-253.
    18. Battigalli, Pierpaolo & Siniscalchi, Marciano, 2003. "Rationalizable bidding in first-price auctions," Games and Economic Behavior, Elsevier, vol. 45(1), pages 38-72, October.
    19. Takeshi Nishimura, 2012. "Optimal Design of Scoring Auction with Multidimensional Quality," Global COE Hi-Stat Discussion Paper Series gd12-238, Institute of Economic Research, Hitotsubashi University.
    20. Choi, Pak-Sing & Espínola-Arredondo, Ana & Muñoz-García, Félix, 2018. "Conservation procurement auctions with bidirectional externalities," Journal of Environmental Economics and Management, Elsevier, vol. 92(C), pages 559-579.

    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:ormnsc:v:49:y:2003:i:11:p:1529-1545. 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.