On the complexity of equilibria

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 67-71

  Deng, Xiaotie ^a   Papadimitriou, Christos ^a   Safra, Shmuel ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR EQUATIONS; LINEAR PROGRAMMING; LINEAR SYSTEMS; POLYNOMIALS; THEOREM PROVING;

COMMUNICATION COMPLEXITY; EQUILIBRIA; INFORMATION ECONOMY; POLYNOMIAL-TIME ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 0036038646     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509920     Document Type: Conference Paper

References (14)

1. Existence of an equilibrium for a competitive economy
2. Complementary pivot theory of mathematical programming
3. The competitive mechanism is dimensionally efficient uniquely
4. Equilibrium in a discrete exchange economy with money
5. On information decentralization and efficiency in resourse allocation mechanism
6. Algebraic cell decomposition in NC (preliminary version)
7. Integer programming with a fixed number of variables
8. Factoring polynomials with rational coefficients
9. Communication complexity of combinatorial auctions
10. The communication complexity of efficient allocation problems
11. Algorithms, games, and the internet
12. On the complexity of the parity argument and other inefficient proofs of existence
13. The complexity of tradeoffs, and optimal access of web sources