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

Strong Substitutes: Structural Properties, and a New Algorithm for Competitive Equilibrium Prices

Author

Listed:
  • Klemperer, Paul
  • Baldwin, Elizabeth
  • Bichler, Martin
  • Fichtl, Maximilian

Abstract

We show the Strong Substitutes Product-Mix Auction (SSPMA) bidding language provides an intuitive and geometric interpretation of strong substitutes as Minkowski differences between sets that are easy to identify.We prove that competitive equilibrium prices for agents with strong substitutes preferences can be computed by minimizing the difference between two linear programs for the positive and the negative bids with suitably relaxed resource constraints. This also leads to a new algorithm for computing competitive equilibrium prices which is competitive with standard steepest descent algorithms in extensive experiments.

Suggested Citation

  • 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.
    • Handle: RePEc:cpr:ceprdp:15831
    as

    Download full text from publisher

    File URL: https://cepr.org/publications/DP15831
    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. Elizabeth Baldwin & Paul W. Goldberg & Paul Klemperer & Edwin Lock, 2019. "Solving Strong-Substitutes Product-Mix Auctions," Economics Papers 2019-W08, Economics Group, Nuffield College, University of Oxford.
    2. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
    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. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    5. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    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. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    2. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    3. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    4. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    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. 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.
    7. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    8. 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.
    9. Shirata, Yasuhiro, 2017. "First price package auction with many traders," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
    10. Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CARF F-Series CARF-F-261, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    11. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    12. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    13. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    14. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    15. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    16. Matsushima Hitoshi, 2018. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretion in VCG Combinatorial Auction," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 18(1), pages 1-16, January.
    17. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    18. Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer’s Discretionin VCG Combinatorial Auction (Published in the B. E. Journal of Theoretical Economics 18 (1), 2018.)," CARF F-Series CARF-F-359, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    19. Paul Klemperer, 2018. "Product-Mix Auction," Economics Papers 2018-W07, Economics Group, Nuffield College, University of Oxford.
    20. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.

    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:15831. 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.