Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
From MaRDI portal
Publication:4978032
DOI10.1145/3055399.3055474zbMath1371.91126OpenAlexW2626895635MaRDI QIDQ4978032
Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod, Jugal Garg
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055399.3055474
Special types of economic equilibria (91B52) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Market equilibrium under piecewise Leontief concave utilities ⋮ Unnamed Item ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Discrete versions of the KKM lemma and their PPAD-completeness
This page was built for publication: Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria