Strong Substitutes: Structural Properties, and a New Algorithm for Competitive Equilibrium Prices
Author
Abstract
Suggested Citation
Download full text from publisher
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:
- Elizabeth Baldwin & Martin Bichler & Maximilian Fichtl & Paul Klemperer, 2021. "Strong Substitutes: Structural Properties, and a New Algorithm for Competitive Equilibrium Prices," Economics Papers 2021-W02, Economics Group, Nuffield College, University of Oxford.
References listed on IDEAS
- 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.
- 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.
- Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
- 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.
- Elizabeth Baldwin & Paul Klemperer, 2015. "Understanding Preferences: “Demand Types”, and the Existence of Equilibrium with Indivisibilities," Economics Papers 2015-W10, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Baldwin, Elizabeth, 2019. "Understanding Preferences: "Demand Types", and the Existence of Equilibrium with Indivisibilities," CEPR Discussion Papers 13586, C.E.P.R. Discussion Papers.
- Baldwin, Elizabeth & Klemperer, Paul, 2016. "Understanding preferences: "demand types", and the existence of equilibrium with indivisibilities," LSE Research Online Documents on Economics 63198, London School of Economics and Political Science, LSE Library.
- 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.
- Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
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.- 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.
- De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
- 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.
- MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Miralles, Antonio & Pycia, Marek, 2021.
"Foundations of pseudomarkets: Walrasian equilibria for discrete resources,"
Journal of Economic Theory, Elsevier, vol. 196(C).
- Pycia, Marek & Miralles, Antonio, 2020. "Foundations of Pseudomarkets: Walrasian Equilibria for Discrete Resources," CEPR Discussion Papers 15161, C.E.P.R. Discussion Papers.
- Antonio Miralles & Marek Pycia, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," ECON - Working Papers 385, Department of Economics - University of Zurich.
- 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.
- 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.
- 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.
- Tomoya Kazumura & Shigehiro Serizawa, 2015. "Efficiency and strategy-proofness in object assignment problems with multi demand preferences," ISER Discussion Paper 0943, Institute of Social and Economic Research, Osaka University.
- 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.
- Shirata, Yasuhiro, 2017.
"First price package auction with many traders,"
Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
- Shirata, Yasuhiro, 2013. "First Price Package Auction with Many Traders," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5134, Otaru University of Commerce.
- 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.
- Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CIRJE F-Series CIRJE-F-806, CIRJE, Faculty of Economics, University of Tokyo.
- Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
- Andersson, Tommy & Erlanson, Albin, 2013.
"Multi-item Vickrey–English–Dutch auctions,"
Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
- Andersson, Tommy & Erlanson, Albin, 2012. "Multi-Item Vickery-English-Dutch Auctions," Working Papers 2012:17, Lund University, Department of Economics, revised 15 Jan 2013.
- Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
- 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.
- Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2005. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Levine's Bibliography 784828000000000133, UCLA Department of Economics.
- Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
- 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.
- Hitoshi Matsushima, 2015. "Connected Price Dynamics with Revealed Preferences and Auctioneer's Discretion in VCG Combinatorial Auction," CIRJE F-Series CIRJE-F-960, CIRJE, Faculty of Economics, University of Tokyo.
- Bichler, Martin & Knörr, Johannes, 2023. "Getting prices right on electricity spot markets: On the economic impact of advanced power flow models," Energy Economics, Elsevier, vol. 126(C).
- Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
- 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.
- Paul Klemperer, 2018.
"Product-Mix Auction,"
Economics Papers
2018-W07, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul, 2019. "Product-Mix Auctions," CEPR Discussion Papers 13667, C.E.P.R. Discussion Papers.
More about this item
Keywords
Competitive equilibrium; Walrasian equilibrium; Strong substitutes; Product-mix auction; Envy-free prices; Indivisible goods; Equilibrium computation; Dc programming; Auction theory; Algorithms;All these keywords.
NEP fields
This paper has been announced in the following NEP Reports:- NEP-COM-2021-05-10 (Industrial Competition)
- NEP-DES-2021-05-10 (Economic Design)
Statistics
Access and download statisticsCorrections
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.