On the complexity of equilibria

DOI10.1145/509907.509920MaRDI QIDQ3579177zbMATH OpenOpenAlexFDO

Authors Shmuel Safra, Xiaotie Deng, Christos 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) Approximation algorithms (68W25) Special types of economic markets (including Cournot, Bertrand) (91B54)

Cited in

(13)

• 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
• A Truthful Mechanism for Offline Ad Slot Scheduling
• Buyer-supplier games: optimization over the core
• Large-scale contextual market equilibrium computation through deep learning
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579177)