The complexity of non-monotone markets

DOI10.1145/2488608.2488632zbMath1293.91065OpenAlexW2068845983MaRDI QIDQ5495788

Mihalis Yannakakis, Xi Chen, Dimitris Paparas

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.758.3575

zbMATH Keywords

computational complexitymarket equilibriumCES utilityPPADFIXP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special types of economic equilibria (91B52) Utility theory (91B16)

Related Items (10)

Inapproximability of Nash Equilibrium ⋮ Market equilibrium under piecewise Leontief concave utilities ⋮ Public goods games in directed networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tatonnement beyond gross substitutes? Gradient descent to the rescue ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich ⋮ A combinatorial polynomial algorithm for the linear Arrow-Debreu market

This page was built for publication: The complexity of non-monotone markets