Rights and Decentralized Computation

Metroeconomica

Volumn 55, Issue 2-3, 2004, Pages 290-317

  Holm, Håkan J ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85040394519     PISSN: 00261386     EISSN: 1467999X     Source Type: Journal    
DOI: 10.1111/j.0026-1386.2004.00194.x     Document Type: Article

References (35)

1. Chvátal V. (1983): Linear Programming, W. H. Freeman, New York.
2. Dantzig G. B. (1951): ‘Maximization of a linear function of variables subject to linear inequalities’, in Koopmans T. C. (ed.): Activity Analysis of Production and Allocation, Wiley, New York, pp. 339–47.
3. Goodwin R. M. (1951): ‘Iteration, automatic computers, and economic dynamics’, Metroeconomica, 3, pp. 1–7.
4. Hausch D. B. (1988): ‘A model of sequential auctions’, Economic Letters, 26, pp. 227–33.
5. Hayek F. A. (1935): Collectivist Economic Planning, Routledge, London.
6. Hayek F. A. (1945): ‘The use of knowledge in society’, American Economic Review, 35, pp. 519–30.
7. Holm H. J. (1995): ‘Computational cost of verifying enforceable contracts’, International Review of Law and Economics, 15, pp. 127–40.
8. Hurwicz L. (1973): ‘The design of mechanisms for resource allocation’, American Economic Review, 63, pp. 1–30.
9. Hurwicz L. (1994): ‘Economic design, adjustment processes, mechanisms, and institutions’, Economic Design, 1, pp. 1–14.
10. Kantorowich L. V. (1959): Economic Calculation of Optimal Utilization of Resources (in Russian), Publishing House of the Academy of Sciences of the USSR, Moscow.
11. Khachiyan L. G. (1979): ‘A polynomial algorithm in linear programming’, English translation in Soviet Mathematics Doklady, 20, pp. 191–94.
12. Klee V., Minty G. J. (1972): ‘How good is the simplex algorithm?’, in Shisha O. (ed.): Inequalities-III, Academic Press, New York, pp. 159–75.
13. Kornai J., Lipták T. (1965): ‘Two level planning’, Econometrica, 33, pp. 141–69.
14. Kramer G. H. (1974): ‘An impossibility result concerning the theory of decision-making’, Cowles Foundation Paper 274, Yale University.
15. Kupfmuller K. (1971): ‘Grundlage der Informationstheorie und Kybernetik’ in Grauer O. H., Kramer K., Jung R. (eds): Physologie des Menschen, Band 10, Allgemeine Neurophysiologie, Urban & Schwarzenberger, München, pp. 195–231.
16. Lange O., Taylor F. M. (1938): On the Economic Theory of Socialism, University of Minnesota Press, Minneapolis, MN.
17. Lewis A. A. (1985): ‘On effectively computable realizations of choice functions’, Mathematical Social Sciences, 10, pp. 43–80.
18. Marschak T. A. (1972): ‘Computation in organizations: the comparison of price mechanisms and other adjustment processes’, in McGuire C. B., Radner R. (eds): Decision and Organization, Norh-Holland, Amsterdam, pp. 237–83.
19. Milgrom P. R., Weber R. J. (1982): ‘A theory of auctions and competitive bidding’, Econometrica, 50, pp. 1089–1122.
20. Mount K., Reiter S. (1974): ‘The informational size of message spaces’, Journal of Economic Theory, 8, pp. 161–92.
21. Mount K., Reiter S. (1990): ‘A model of computing with human agents’, Discussion Paper 890, Center for Mathematical Studies in Economics and Management Science, Northwestern University.
22. Norman A. N. (1987): ‘A theory of monetary exchange’, Review of Economic Studies, 54, pp. 499–517.
23. Oniki H. (1974): ‘The cost of communication in economic organization’, Quarterly Journal of Economics, 88, pp. 529–50.
24. Papadimitriou C. H., Steiglitz K. (1982): Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
25. Rabin M. O. (1957): ‘Effective computability of winning strategies’, in Dresher M. (ed.): Contribution to the Theory of Games, vol. III, Annals of Mathematics Studies 39, Princeton University Press, Princeton, NJ, pp. 147–57.
26. Radner R. (1993): ‘The organization of decentralized information processing’, Econometrica, 61, pp. 1109–46.
27. Rustem B., Velupillai K. (1990): ‘Rationality, computability and complexity’, Journal of Economic Dynamics and Control, 14, pp. 1–13.
28. Scarf H. (1990): ‘Mathematical programming and economic theory’, Operations Research, 38, pp. 377–85.
29. Simon H. A. (1955): ‘A behavioral model of rational choice’, Quarterly Journal of Economics, 69, pp. 99–118.
30. Spear S. E. (1989): ‘Learning rational expectations under computability constraints’, Econometrica, 57, pp. 889–910.
31. Stockmeyer L. (1992): ‘Computational complexity’, in Coffman E., Lenstra J., Rinnooy Kan A. (eds): Computing Handbook in Operations Research and Management Science, vol. 3, North-Holland, Amsterdam.
32. Velupillai K. (2000): Computable Economics: The Arne Ryde Memorial Lecture Series, Oxford University Press, Oxford.
33. Vickrey W. (1961): ‘Counterspeculation, auctions and competitive sealed tenders’, Journal of Finance, 16, pp. 305–21.
34. Whitehead A. N. (1911): Introduction to Mathematics, Williams & Norgate, London.
35. Zimmerman M. (1989): ‘The nervous system in the context of information theory’, in Thews G. (ed.): Human Physiology, 2nd edn, Springer, Berlin.