IDEAS home Printed from https://ideas.repec.org/p/cpr/ceprdp/14976.html
   My bibliography  Save this paper

Solving Strong-Substitutes Product-Mix Auctions

Author

Listed:
  • Klemperer, Paul
  • Baldwin, Elizabeth
  • Goldberg, Paul
  • Lock, Edwin

Abstract

This paper develops algorithms to solve strong-substitutes product-mix auctions: it finds competitive equilibrium prices and quantities for agents who use this auction’s bidding language to truthfully express their strong-substitutes preferences over an arbitrary number of goods, each of which is available in multiple discrete units. Our use of the bidding language, and the information it provides, contrasts with existing algorithms that rely on access to a valuation or demand oracle. We compute market-clearing prices using algorithms that apply existing submodular minimisation methods. Allocating the supply among the bidders at these prices then requires solving a novel constrained matching problem. Our algorithm iteratively simplifies the allocation problem, perturbing bids and prices in a way that resolves tie-breaking choices created by bids that can be accepted on more than one good. We provide practical running time bounds on both price-finding and allocation, and illustrate experimentally that our allocation mechanism is practical.

Suggested Citation

  • Klemperer, Paul & Baldwin, Elizabeth & Goldberg, Paul & Lock, Edwin, 2020. "Solving Strong-Substitutes Product-Mix Auctions," CEPR Discussion Papers 14976, C.E.P.R. Discussion Papers.
    • Handle: RePEc:cpr:ceprdp:14976
    as

    Download full text from publisher

    File URL: https://cepr.org/publications/DP14976
    Download Restriction: CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org
    ---><---

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

    Other versions of this item:

    References listed on IDEAS

    as
    1. Gul, Faruk & Stacchetti, Ennio, 2000. "The English Auction with Differentiated Commodities," Journal of Economic Theory, Elsevier, vol. 92(1), pages 66-95, May.
    2. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.
    3. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    4. Paul Klemperer, 2010. "The Product-Mix Auction: A New Auction Design for Differentiated Goods," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 526-536, 04-05.
    5. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    6. Danilov, Vladimir & Koshevoy, Gleb & Murota, Kazuo, 2001. "Discrete convexity and equilibria in economies with indivisible goods and money," Mathematical Social Sciences, Elsevier, vol. 41(3), pages 251-273, May.
    7. Milgrom, Paul & Strulovici, Bruno, 2009. "Substitute goods, auctions, and equilibrium," Journal of Economic Theory, Elsevier, vol. 144(1), pages 212-247, January.
    8. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    9. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2013. "Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items," Discussion Papers 13/13, Department of Economics, University of York.
    10. Kazuo Murota & Akiyoshi Shioura, 1999. "M-Convex Function on Generalized Polymatroid," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 95-105, 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. Paul Klemperer, 2018. "Product-Mix Auction," Economics Papers 2018-W07, Economics Group, Nuffield College, University of Oxford.
    2. Klemperer, Paul & Baldwin, Elizabeth & Bichler, Martin & Fichtl, Maximilian, 2021. "Strong Substitutes: Structural Properties, and a New Algorithm for Competitive Equilibrium Prices," CEPR Discussion Papers 15831, C.E.P.R. Discussion Papers.

    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. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    2. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    3. Ozan Candogan & Markos Epitropou & Rakesh V. Vohra, 2021. "Competitive Equilibrium and Trading Networks: A Network Flow Approach," Operations Research, INFORMS, vol. 69(1), pages 114-147, January.
    4. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    5. Ravi Jagadeesan & Alexander Teytelboym, 2024. "The Economics of Equilibrium with Indivisible Goods," Papers 2412.07946, arXiv.org.
    6. Elizabeth Baldwin & Paul Klemperer, 2019. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities," Econometrica, Econometric Society, vol. 87(3), pages 867-932, May.
    7. Elizabeth Baldwin & Omer Edhan & Ravi Jagadeesan & Paul Klemperer & Alexander Teytelboym, 2020. "The Equilibrium Existence Duality: Equilibrium with Indivisibilities & Income Effects," Papers 2006.16939, arXiv.org.
    8. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    9. Huang, Chao, 2018. "Independence systems in gross-substitute valuations," Economics Letters, Elsevier, vol. 173(C), pages 135-137.
    10. Yokote, Koji, 2017. "Application of the discrete separation theorem to auctions," MPRA Paper 82884, University Library of Munich, Germany.
    11. Chao Huang, 2024. "A dynamic auction for multilateral collaboration," Papers 2411.06545, arXiv.org.
    12. Mingrong Wang & Mingxi Wang & Lihua Lang, 2017. "Reconsidering Carbon Permits Auction Mechanism: An Efficient Dynamic Model," The World Economy, Wiley Blackwell, vol. 40(8), pages 1624-1645, August.
    13. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    14. Fichtl, Maximilian, 2021. "On the expressiveness of assignment messages," Economics Letters, Elsevier, vol. 208(C).
    15. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    16. Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
    17. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    18. Marie-Charlotte Brandenburg & Christian Haase & Ngoc Mai Tran, 2021. "Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes," Papers 2107.08813, arXiv.org, revised Nov 2021.
    19. Eric Balkanski & Renato Paes Leme, 2020. "On the Construction of Substitutes," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 272-291, February.
    20. Paes Leme, Renato, 2017. "Gross substitutability: An algorithmic survey," Games and Economic Behavior, Elsevier, vol. 106(C), pages 294-316.

    More about this item

    Keywords

    Bidding language; Product-mix auction; Competitive equilibrium; Walrasian equilibrium; Convex optimisation; Strong substitutes; Submodular minimisation;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:cpr:ceprdp:14976. 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: the person in charge (email available below). General contact details of provider: https://www.cepr.org .

    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.