On the complexity of price equilibria

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 311-324

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

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; ECONOMICS; MARKETING; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RESOURCE ALLOCATION; THEOREM PROVING; VECTORS;

POLYNOMIAL ALGORITHM; PRICE EQUILIBRIA;

COMPUTATIONAL COMPLEXITY;

EID: 0142091464     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00011-4     Document Type: Article

References (16)

1. K.J. Arrow, G. Debreu, Existence of an equilibrium for a competitive economy, Econometrica 22 (1954) 265-290.
2. X. Calsamiglia, Informational requirements of parametric resource allocation processes, in: T. Grooves, R. Radner, S. Reiter (Eds.), Information, Incentives, and Economic Mechanisms, University of Minnesota Press, Minneapolis, MN, 1987.
3. N. Devanur, C.H. Papadimitriou, A. Saberi, V.V. Vazirani, Market equilibrium via a primal-dual-type algorithm, Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, November 16-19, 2002, pp. 389-395.
4. D. Gale, Theory of Linear Economic Models, McGraw-Hill, New York, 1960.
5. D. Gale, Equilibrium in a discrete exchange economy with money, Internat. J. Game Theory 13 (1) (1984) 61-64.
6. L. Hurwicz, On information decentralization and efficiency in resource allocation mechanism. in: S. Reiter (Ed.), Studies in Mathematical Economics, 1986, Mathematical Association of America Studies in Mathematics, pp. 238-350.
7. J. Jordan, The competitive allocation process is informationally efficient uniquely, J. Econom. Theory 28 (1982) 1-18.
8. D. Kozen, C. Yap, Algebraic cell decomposition in NC, Proceedings of 25th Annual IEEE Symposium on Foundations of Computer Science, 1985, Portland, OR, pp. 515-521.
9. N. Nisan, Bidding and allocation in combinatorial auctions? Proceedings of 2000 ACM Conference on Electronic Commerce, Minneapolis, MN, 2000.
10. N. Nisan, The communication complexity of approximate set packing and covering, Proceedings of 2002 ICALP, Malaga, Spain, pp. 868-875.
11. N. Nisan, I. Segal, The communication complexity of combinatorial auctions, manuscript, 2002, available from http://www.cs.huji.ac.il/noam/.
12. C.H. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, J. Comput. System Sci. 48 (3) (1994) 498-532.
13. C.H. Papadimitriou, Algorithms, games, and the internet, Proceedings of STOC 2001, Heraklion, Crete, Greece, pp. 749-753.
14. C.H. Papadimitriou, M. Yannakakis, The complexity of tradeoffs, and optimal access of web sources, Proceedings of FOCS 2000, Redondo Beach, CA, pp. 86-93.
15. H. Scarf, The Computation of Economic Equilibria (with Collaboration of T. Hansen), Cowles Foundation Monograph No. 24, Yale University Press, New Haven, 1973.
16. L. Shapley, H. Scarf, On cores and indivisibilities, J. Math. Econom. 1 (1974) 23-37.