Improved algorithms for computing fisher's market clearing prices
From MaRDI portal
Publication:2875155
DOI10.1145/1806689.1806731zbMath1293.68152OpenAlexW2053060972WikidataQ59592324 ScholiaQ59592324MaRDI QIDQ2875155
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
Auctions, bargaining, bidding and selling, and other market models (91B26) General equilibrium theory (91B50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (16)
Approximating the Nash Social Welfare with Indivisible Items ⋮ A Simplex-Like Algorithm for Fisher Markets ⋮ Nash Equilibria in Fisher Market ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ Market equilibrium under piecewise Leontief concave utilities ⋮ Fair Division of Indivisible Goods for a Class of Concave Valuations ⋮ When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores ⋮ Efficient Fair Division with Minimal Sharing ⋮ Incentive ratio: a game theoretical analysis of market equilibria ⋮ Market exchange models and geometric programming ⋮ Tatonnement beyond gross substitutes? Gradient descent to the rescue ⋮ Amortized Analysis of Asynchronous Price Dynamics ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Ascending-Price Algorithms for Unknown Markets ⋮ Unnamed Item ⋮ A combinatorial polynomial algorithm for the linear Arrow-Debreu market
This page was built for publication: Improved algorithms for computing fisher's market clearing prices
