Computational Economics

, Volume 45, Issue 2, pp 337–358 | Cite as

Back to the Future: Economic Self-Organisation and Maximum Entropy Prediction



This paper shows that signal restoration methodology is appropriate for predicting the equilibrium state of certain economic systems. A formal justification for this is provided by proving the existence of finite improvement paths in object allocation problems under weak assumptions on preferences, linking any initial condition to a Nash equilibrium. Because a finite improvement path is made up of a sequence of systematic best-responses, backwards movement from the equilibrium back to the initial condition can be treated like the realisation of a noise process. This underpins the use of signal restoration to predict the equilibrium from the initial condition, and an illustration is provided through an application of maximum entropy signal restoration to the Schelling model of segregation.


Information entropy Self-organisation Potential function  Schelling segregation 

JEL Classification

C02 C11 C63 D80 


  1. Alfarano, S., & Milaković, M. (2008). Does classical competition explain the statistical features of firm growth? Economics Letters, 101, 272–274.CrossRefGoogle Scholar
  2. Castaldi, C., & Milaković, M. (2007). Turnover activity in wealth portfolios. Journal of Economic Behavior and Organization, 63, 537–552.CrossRefGoogle Scholar
  3. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. New York: Wiley.CrossRefGoogle Scholar
  4. Dowsland, K. A., & Thompson, J. M. (2000). Solving a nurse scheduling problem with knapsacks, networks and tabu search. Journal of the Operational Research Society, 51, 825–833.CrossRefGoogle Scholar
  5. Fagiolo, G., Moneta, A., & Windrum, P. (2007). A critical guide to empirical validation of agent-based models in economics: Methodologies, procedures, and open problems. Computational Economics, 30, 195–226.CrossRefGoogle Scholar
  6. Foley, D. K. (1994). A statistical equilibrium theory of markets. Journal of Economic Theory, 62, 321–345.CrossRefGoogle Scholar
  7. Grauwin, S., Goffette-Nagot, F., & Jensen, P. (2012). Dynamic models of residential segregation: An analytical solution. Journal of Public Economics, 96, 124–141.Google Scholar
  8. Harris, M., & Raviv, A. (1981). Allocation mechanisms and the design of auctions. Econometrica, 49, 1477–1499.CrossRefGoogle Scholar
  9. Hayek, F. (1945). The use of knowledge in society. American Economic Review, 35, 519–530.Google Scholar
  10. Hifi, M., Michrafy, M., & Sbihi, A. (2004). Heuristic algorithms for the multiple-choice multidimensional knapsack problem. Journal of the Operational Research Society, 55, 1323–1332.CrossRefGoogle Scholar
  11. Hurwicz, L. (1973). The design of mechanisms for resource allocation. American Economic Review, 63, 1–30.Google Scholar
  12. Jaynes, E. T. (1957). Information theory and statistical mechanics. The Physical Review, 106, 620–630.CrossRefGoogle Scholar
  13. Khan, S., Li, K. F., Manning, E. G., & Akbar, M. (2002). Solving the knapsack problem for adaptive media systems. Studia Informatica, 2, 161–182.Google Scholar
  14. Marks, R. E. (2007). Validating simulation models: A general framework and four applied examples. Computational Economics, 30, 265–290.CrossRefGoogle Scholar
  15. Monderer, D., & Shapely, L. S. (1996). Potential games. Games and Economic Behaviour, 14, 124–143.CrossRefGoogle Scholar
  16. Myerson, R. B. (1981). Optimal auction design. Mathematics of Operations Research, 6, 58–73.CrossRefGoogle Scholar
  17. Ng, Y. K. (1975). Bentham or bergson? Finite sensibility, utility functions and social welfare functions. The Review of Economic Studies, 42, 545–569.Google Scholar
  18. Rosenthal, R. W. (1973). A class of games possesing pure-strategy nash equilibria. International Journal of Game Theory, 2, 65–67.CrossRefGoogle Scholar
  19. Sbihi, A. (2007). A best first search exact algorithm for the multiple-choice multidimensional knapsack problem. Journal of Combinatorial Optimisation, 13, 337–351.CrossRefGoogle Scholar
  20. Schelling, T. C. (1969). Models of segregation. American Economic Review, 59, 488–493.Google Scholar
  21. Schelling, T. C. (1971). Dynamic models of segregation. Journal of Mathematical Sociology, 1, 143–186.CrossRefGoogle Scholar
  22. Schrödinger, E. (1967). What is life? with mind and matter and autobiographical sketches. Cambridge: Cambridge University Press.Google Scholar
  23. Shannon, C. E. (1948). A mathematical theory of communication. The Bell System Technical Journal, 27, 379–423.CrossRefGoogle Scholar
  24. Shore, J. E., & Johnson, R. (1980). Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Transactions on Information Theory, 26, 26–37.CrossRefGoogle Scholar
  25. Skilling, J., & Gull, S. F. (1987). Maximum-Entropy and Bayesian spectral analysis and estimation problem. Dordrecht: Kluwer.Google Scholar
  26. Skilling, J., & Gull, S. F. (1991). Bayesian maximum-entropy image reconstruction. Spatial Statistics and Imaging, 20, 341–367.CrossRefGoogle Scholar
  27. Tesfatsion, L. (2006) Handbook of computational economics. Agent-based computational economics, North-Holland, chap Agent-based computational economics: A constructive approach to, economic theory (Vol. 2, pp. 831–880).Google Scholar
  28. Toda, A. A. (2010). Existence of a statistical equilibrium for an economy with endogenous offer sets. Economic Theory, 45, 379–415.CrossRefGoogle Scholar
  29. Vinkovic, D., & Kirman, A. (2006). A physical analogue of the Schelling model. Proceedings of the National Academy of Sciences, 103, 19261–19265.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.School of Economics, Keynes CollegeUniversity of KentCanterburyUnited Kingdom
  2. 2.Observatoire Français des Conjonctures Economiques, 69 quai d’OrsayParis Cedex 07France

Personalised recommendations