Improved algorithms for computing Fisher's market clearing prices
DOI10.1145/1806689.1806731zbMATH Open1293.68152DBLPconf/stoc/Orlin10OpenAlexW2053060972WikidataQ59592324 ScholiaQ59592324MaRDI QIDQ2875155FDOQ2875155
Authors: James B. Orlin 
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/68009
Recommendations
Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General equilibrium theory (91B50)
Cited In (25)
- Approximating the Nash Social Welfare with Indivisible Items
- How to allocate goods in an online market?
- Improved balanced flow computation using parametric flow
- Efficient Fair Division with Minimal Sharing
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Nash equilibria in Fisher market
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Amortized Analysis of Asynchronous Price Dynamics
- A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Towards polynomial simplex-like algorithms for market equilibria
- Ascending-price algorithms for unknown markets
- The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores
- Market equilibrium under piecewise Leontief concave utilities
- Incentive ratio: a game theoretical analysis of market equilibria
- Algorithms – ESA 2004
- A simplex-like algorithm for Fisher markets
- Application of PDSS to improve the pricing efficiency of wholesale fish markets
- Tight incentive analysis of Sybil attacks against the market equilibrium of resource exchange over general networks
- Market exchange models and geometric programming
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Algorithms and Computation
- Tatonnement beyond gross substitutes? Gradient descent to the rescue
- Earning limits in Fisher markets with spending-constraint utilities
This page was built for publication: Improved algorithms for computing Fisher's market clearing prices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875155)
