On the complexity of equilibria

Authors:
Xiaotie Deng;Christos Papadimitriou;Shmuel Safra
Affiliations:
City University of Hong Kong, Hong Kong, China;University of California, Berkeley, CA;Tel Aviv University, Israel
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 3
Cited 54

On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Extensions of the spending constraint model: existence and uniqueness of equilibria [Extended Abstract]

Proceedings of the 4th ACM conference on Electronic commerce
Combinatorial auction across independent markets [Extended Abstract]

Proceedings of the 4th ACM conference on Electronic commerce
Pure Nash equilibria: hard and easy games

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
The complexity of economic equilibria for house allocation markets

Information Processing Letters
Computing equilibria for congestion games with (im)perfect information

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On approximately fair allocations of indivisible goods

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Network games

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Auction algorithms for market equilibrium

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On complexity of single-minded auction

Journal of Computer and System Sciences
The computation of market equilibria

ACM SIGACT News
On algorithms for discrete and approximate brouwer fixed points

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Computing equilibria in multi-player games

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On profit-maximizing envy-free pricing

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Combination can be hard: approximability of the unique coverage problem

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Leontief economies encode nonzero sum two-player games

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Auction Algorithms for Market Equilibrium

Mathematics of Operations Research
A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property

Theoretical Computer Science
An auction-based market equilibrium algorithm for a production model

Theoretical Computer Science
Proportional response dynamics leads to market equilibrium

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Matching algorithmic bounds for finding a Brouwer fixed point

Journal of the ACM (JACM)
An experimental study of different approaches to solve the market equilibrium problem

Journal of Experimental Algorithmics (JEA)
Market equilibrium via a primal--dual algorithm for a convex program

Journal of the ACM (JACM)
The computation of approximate competitive equilibrium is PPAD-hard

Information Processing Letters
On domination game analysis for microeconomic data mining

ACM Transactions on Knowledge Discovery from Data (TKDD)
A Truthful Mechanism for Offline Ad Slot Scheduling

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
A Fast and Simple Algorithm for Computing Market Equilibria

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Increasing Bid Expressiveness for Effective and Balanced E-Barter Trading

Declarative Agent Languages and Technologies VI
Proportional Response Dynamics in the Fisher Market

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Pure Nash equilibria: hard and easy games

Journal of Artificial Intelligence Research
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Majority equilibrium for public facility allocation

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Computing market equilibrium: beyond weak gross substitutes

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Buyer-supplier games: optimization over the core

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A simplex-like algorithm for fisher markets

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Buyer-games: Optimization over the core

Theoretical Computer Science
Market communication in production economies

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Distributed algorithms via gradient descent for fisher markets

Proceedings of the 12th ACM conference on Electronic commerce
How profitable are strategic behaviors in a market?

ESA'11 Proceedings of the 19th European conference on Algorithms
New results on rationality and strongly polynomial time solvability in eisenberg-gale markets

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Interference-aware selfish routing in multi-ratio multi-channel wireless mesh networks

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
On-line algorithms for market equilibria

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A primal-dual algorithm for computing fisher equilibrium in the absence of gross substitutability property

WINE'05 Proceedings of the First international conference on Internet and Network Economics
An auction-based market equilibrium algorithm for a production model

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Majority equilibrium of distribution centers allocation in supply chain management

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Multi-agent based selfish routing for multi-channel wireless mesh networks

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Market equilibrium for CES exchange economies: existence, multiplicity, and computation

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Computing equilibrium prices in exchange economies with tax distortions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
(Non)-approximability for the multi-criteria TSP(1, 2)

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Buy-sell auction mechanisms in market equilibrium

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Supporting top-K item exchange recommendations in large online communities

Proceedings of the 15th International Conference on Extending Database Technology
Incentive ratios of fisher markets

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove complexity, approximability, and inapproximability results for the problem of finding an exchange equilibrium in markets with indivisible (integer) goods, most notably a polynomial-time algorithm that approximates the market equilibrium arbitrarily closely when the number of goods is bounded and the utilities are linear. We also show a communication complexity lower bound, implying that the ideal informational economy of a market with unique individual optima is unattainable in general.