Notes
It should be noted here that my simulation differs from Schelling’s (1978) in several respects–his criterion for “unhappiness” was a bit more elaborate, and his model (which used dimes and pennies as markers) did not employ wraparound, for instance—but the basic idea is the same.
Parenthetically, one could artificially impose an arrangement in which all 100 Torustown cells are happily occupied according to our new rule, with 50 each of Type 1 and Type 2. I leave this as an exercise to the reader.
References
Abelson, H., Sussman, G. J., & Sussman, J. (1996). Structure and interpretation of computer programs (2nd ed.). Cambridge, MA: MIT Press.
Schelling, T. (1978). Micromotives and macrobehavior. New York: W.W. Norton.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eisenberg, M. Computational Diversions: There Goes the Neighborhood. Int J Comput Math Learning 14, 195–202 (2009). https://doi.org/10.1007/s10758-009-9150-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10758-009-9150-1