Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices

DOI10.1007/S10107-022-01792-WMaRDI QIDQ6120905zbMATH OpenOpenAlexFDO

Authors Elizabeth Baldwin, Martin Bichler, Maximilian Fichtl, Paul D. Klemperer

Publication date 21 February 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10107-022-01792-w

zbMATH Keywords

algorithmsauction theorycompetitive equilibriumDC programmingenvy-free pricesequilibrium computationindivisible goodsproduct mix auctionproduct-mix auctionstrong substitutesWalrasian equilibrium

Mathematics Subject Classification ID

Linear programming (90C05) Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Solving strong-substitutes product-mix auctions
• Substitute goods, auctions, and equilibrium
• Learning strong substitutes demand via queries
• A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms
• Equilibrium, auction, and generalized gross substitutes and complements

Cites work

• A duality principle for non-convex optimisation and the calculus of variations
• A framework of discrete DC programming by discrete convex analysis
• Competitive equilibrium in an exchange economy with indivisibilities
• Computing the Continuous Discretely
• Computing Walrasian equilibria: fast algorithms and structural properties
• Continuous relaxation for discrete DC programming
• Convex Analysis
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Convex Bodies The Brunn-MinkowskiTheory
• DC programming: overview.
• Discrete Convex Analysis
• Discrete convexity and equilibria in economies with indivisible goods and money
• Gross substitutability: an algorithmic survey
• Gross substitutes and endowed assignment valuations
• GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
• Job Matching, Coalition Formation, and Gross Substitutes
• Learning strong substitutes demand via queries
• Network flows. Theory, algorithms, and applications.
• New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
• On the expressiveness of assignment messages
• Subquadratic submodular function minimization
• Substitute goods, auctions, and equilibrium
• The communication requirements of efficient allocations and supporting prices
• The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The finite matroid-based valuation conjecture is false
• The package assignment model.
• Understanding preferences: ``demand types, and the existence of equilibrium with indivisibilities
• Walrasian equilibria from an optimization perspective: A guide to the literature
• Walrasian equilibrium with gross substitutes

Cited in

(2)

• Learning strong substitutes demand via queries
• Solving strong-substitutes product-mix auctions

This page was built for publication: Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120905)