On the complexity of equilibria

Xiaotie Deng; Christos Papadimitriou; Shmuel Safra

doi:10.1145/509907.509920

On the complexity of equilibria

Xiaotie Deng^*, Christos Papadimitriou, Shmuel Safra

^*Corresponding author for this work

City University of Hong Kong

Research output: Contribution to journal › Conference article › peer-review

89 Scopus citations

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.

Original language	English
Pages (from-to)	67-71
Number of pages	5
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/509907.509920
State	Published - 2002
Externally published	Yes
Event	Proceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada Duration: 19 May 2002 → 21 May 2002

Access to Document

10.1145/509907.509920

Cite this

@article{d63fdfd46cfa4c7cbbf38ef1bce4b69f,

title = "On the complexity of equilibria",

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.",

author = "Xiaotie Deng and Christos Papadimitriou and Shmuel Safra",

year = "2002",

doi = "10.1145/509907.509920",

language = "אנגלית",

pages = "67--71",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 34th Annual ACM Symposium on Theory of Computing ; Conference date: 19-05-2002 Through 21-05-2002",

}

TY - JOUR

T1 - On the complexity of equilibria

AU - Deng, Xiaotie

AU - Papadimitriou, Christos

AU - Safra, Shmuel

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036038646&partnerID=8YFLogxK

U2 - 10.1145/509907.509920

DO - 10.1145/509907.509920

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0036038646

SN - 0734-9025

SP - 67

EP - 71

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 34th Annual ACM Symposium on Theory of Computing

Y2 - 19 May 2002 through 21 May 2002

ER -

On the complexity of equilibria

Abstract

Access to Document

Other files and links

Fingerprint

Cite this