On the complexity of equilibria
From MaRDI portal
Publication:3579177
DOI10.1145/509907.509920zbMath1192.91145MaRDI QIDQ3579177
Shmuel Safra, Xiaotie Deng, Christos H. Papadimitriou
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509920
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
91B54: Special types of economic markets (including Cournot, Bertrand)
68W25: Approximation algorithms
Related Items
A Truthful Mechanism for Offline Ad Slot Scheduling, Buyer-supplier games: optimization over the core, A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property, Walrasian equilibrium: Hardness, approximations and tractable instances, The computation of approximate competitive equilibrium is PPAD-hard, The complexity of economic equilibria for house allocation markets, On complexity of single-minded auction, A path to the Arrow-Debreu competitive market equilibrium, Approximate competitive equilibrium with generic budget, Incentive ratio: a game theoretical analysis of market equilibria, Computing the Deficiency of Housing Markets with Duplicate Houses, A Simplex-Like Algorithm for Fisher Markets