A lower bound on computational complexity given by revelation mechanisms

Economic Theory

Volumn 7, Issue 2, 1996, Pages 237-266

  Mount, Kenneth R ^a   Reiter, Stanley ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030304299     PISSN: 09382259     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01213904     Document Type: Article

References (31)

1. Abelson, H.: Lower bounds on information transfer in distributed computations. JACM 27, 384-392 (1980)
2. Arbib, M. A.: Theories of abstract automata. Englewood Cliff, New Jersey: Prentice Hall, Inc. 1969
3. Chen, P.: A lower bound for the dimension of the message space of the decentralized mechanisms realizing a given goal. J. Math. Econ. 21, 249-270 (1992)
4. Golubitsky, M., Guillemin, V.: Stable mappings and their singularities. In: Graduate texts in mathematics No. 14. New York: Springer 1973
5. Hurwicz, L.: On informational decentralization and efficiency in resource allocation mechanisms. In: Reiter, S. (ed.) Studies in mathematical economics, Vol. 25. The Mathematical Association of America, 1986
6. Hurwicz, L.: On informationally decentralized systems. In: McGuire, B., Radner, R. (eds.) Decisions and organizations. Amsterdam: North Holland 1972
7. Hurwicz, L., Reiter, S., Saari, D.: On constructing an informationally decentralized process implementing a given performance function. Mimeo, presented and distributed at the Econometric Society World Congress, Aix-en-Province, 1980
8. Jordan, J. S.: The competitive allocation process is informationally efficient uniquely. J. Econ. Theory 28, 1-18 (1982)
9. Jordan, J. S.: The informational requirements of local stability in decentralized allocation mechanisms. In: Groves, T., Radner, R., Reiter, S. (eds.) Information, incentives and economic mechanisms. Minneapolis: University of Minnesota Press 1987
10. Kalai, E., Stanford, W.: Finite rationality and interpersonal complexity in repeated games. Econometrica 56, 397-410 (1988)
11. Leontief, W.: A note on the interrelation of subsets of independent variables of a continuous function with continuous first derivatives. Bull. AMS 53, 343-350 (1947)
12. Mac Lane, S.: Categories for the working mathematician. Graduate texts in mathematics No. 5. New York: Springer Verlag 1971
13. Mount, K. R., Reiter, S.: The informational size of message spaces. J. Math. Econ. 8, 161-192 (1974)
14. Mount, K. R., Reiter, S.: Computation, communication, and performance in resource allocation. Presented at the CEME-NBER Decentralization Seminar, University of Minnesota, May 21-23, 1982. Mimeo, Northwestern University, 1983
15. Mount, K. R., Reiter, S.: On the existence of a locally stable dynamic process with a statically minimal message space. In: Groves, T., Radner, R., Reiter, S. (eds.) Information, incentives and economic mechanisms. Minneapolis: University of Minnesota Press 1983
16. Mount, K. R., Reiter, S.: A model of computing with human agents. Discussion Paper No. 890; The Center for Mathematical Studies in Economics and Managerial Science, Northwestern University, 1990
17. Neyman, A.: Bounded complexity justifies cooperation in the finitely repeated prisoners dilemma. Econ. Lett. 19, 227-229 (1985)
18. Reichelstein, S.: On the informational requirements for the implementation of social choice rules. Handout for the Decentralization Conference, Minneapolis, May 1982
19. Reichelstein, S.: Incentive compatibility and informational requirements. J. Econ. Theory 32, 384-390 (1984)
20. Reichelstein, S.: Reiter, S.: Game forms with minimal message spaces. Econometrica 56, 661-692 (1988)
21. Reiter, S.: Information incentive and performance in the new welfare economics. Papers and Proceedings of the Eighty-Ninth Annual Meting of the American Economic Association. Am. Econ. Rev. 67, 219-237 (1977). Reprinted in Mathematical Economics. Mathematical Association of America, 1987.
22. Reiter, S.: Information incentive and performance in the new welfare economics. Papers and Proceedings of the Eighty-Ninth Annual Meting of the American Economic Association. Am. Econ. Rev. 67, 219-237 (1977). Reprinted in Mathematical Economics. Mathematical Association of America, 1987.
23. Reiter, S.: There is no adjustment process with two-dimensional message spaces for counter examples. Summarized in [5]
24. Reiter, S.: A decentralized process for finding equilibria given by linear equations. Mimeo, Northwestern University, 1994
25. Reiter, S.: Simon, C. P.: Decentralized dynamic processes for finding equilibrium. J. Econ. Theory, 56, 83-96 (1992)
26. Rubenstein, A.: Finite automata play the repeated prisoner's dilemma. J. Econ. Theory 39, 83-96 (1986)
27. Saari, D., Simon, C. P.: Effective price mechanisms. Econometrica 46, 1097-1125 (1978)
28. Serre, J. P.: Lie algebras and Lie groups New York: W. A. Benjamin, Inc. 1965
29. Sonnenschein, H.: An axiomatic characterization of the price mechanism. Econometrica 42, 425-460 (1974)
30. Widder, D. V.: Advanced calculus. New York: Prentice Hall 1963
31. Williams, S.: Necessary and sufficient conditions for the existence of a locally stable message process. J. Econ. Theory 35, 127-154 (1988)