On the complexity of equilibria

DOI10.1145/509907.509920zbMath1192.91145OpenAlexW2047880045MaRDI 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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Special types of economic markets (including Cournot, Bertrand) (91B54) Approximation algorithms (68W25)

Related Items (12)

A Simplex-Like Algorithm for Fisher Markets ⋮ A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property ⋮ Approximate competitive equilibrium with generic budget ⋮ Incentive ratio: a game theoretical analysis of market equilibria ⋮ Buyer-supplier games: optimization over the core ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ A path to the Arrow-Debreu competitive market equilibrium ⋮ On complexity of single-minded auction ⋮ The computation of approximate competitive equilibrium is PPAD-hard ⋮ Computing the Deficiency of Housing Markets with Duplicate Houses ⋮ A Truthful Mechanism for Offline Ad Slot Scheduling ⋮ The complexity of economic equilibria for house allocation markets

This page was built for publication: On the complexity of equilibria