Sugarscape is a model forartificially intelligentagent-basedsocial simulation following some or all rules presented byJoshua M. Epstein &Robert Axtell in their bookGrowing Artificial Societies.[1]
Fundaments of Sugarscape models can be traced back to theUniversity of Maryland where economistThomas Schelling presented his paper titledModels of Segregation.[2] Written in 1969, Schelling and the rest of thesocial environment modelling fraternity had their options limited by a lack of adequate computing power and an applicable programming mechanism to fully develop the potential of their model.
John Conway's agent-based simulation "Game of Life" was enhanced and applied to Schelling's original idea byJoshua M. Epstein andRobert Axtell in their bookGrowing Artificial Societies. To demonstrate their findings on the field of agent-based simulation, a model was created and distributed with their book on CD-ROM. The concept of this model has come to be known as "the Sugarscape model".[1] Since then, the name "Sugarscape" has been used for agent-based models using rules similar to those defined by Epstein & Axtell.
All Sugarscape models include theagents (inhabitants), the environment (a two-dimensional grid) and the rules governing the interaction of the agents with each other and the environment.
The original model presented by J. Epstein & R. Axtell (considered as thefirst large scale agent model) is based on a 51x51 cell grid, where every cell can contain different amounts of sugar (or spice). In every step agents look around, find the closest cell filled with sugar, move and metabolize. They can leave pollution, die, reproduce, inherit sources, transfer information, trade or borrow sugar, generate immunity or transmit diseases - depending on the specific scenario and variables defined at the set-up of the model.
Sugar in simulation could be seen as a metaphor for resources in an artificial world through which the examiner can study the effects of social dynamics such as evolution, marital status and inheritance on populations.[3]
Exact simulation of the original rules provided by J. Epstein & R. Axtell in their book can be problematic[4] and it is not always possible to recreate the same results as those presented inGrowing Artificial Societies.
The Sugarscape model has had several implementations, some of which are available asfree and open source software.
An original implementation was developed inAscape,Java software suitable foragent-based social simulation. The Sugarscape model remains part of the built-in library of models distributed with Ascape.[5]
NetLogo has been used to build Sugarscape models. Three Sugarscape scenarios are included in the NetLogo Models Library: "Immediate Growback", "Constant Growback" and "Wealth Distribution". Besides these three scenarios lies Iain Weaver's Sugarscape NetLogo model, which is part of the User Community Models Library. "It builds on Owen Densmore's NetLogo community model to encompass all rules discussed inGrowing Artificial Societies with the exception of the combat rule (although trivial to include, it adds little value to the model)."[6] The model is equipped with rich documentation[7] including instructions for successful replication of the original Sugarscape rules.[4]
Due to the emergent nature ofagent-based models (ABMs), it is critical that the population sizes in the simulations match the population sizes of the dynamic systems being modelled.[8] However, the performance of contemporary agent simulation frameworks has been inadequate to handle such large population sizes andparallel computing frameworks designed to run oncomputing clusters has been limited by available bandwidth. As computing power increases withMoore's law, the size and complexity of simulation frameworks can be expected to increase. The team of R. M. D’Souza, M. Lysenko and K Rahmani fromMichigan Technological University used a Sugarscape model to demonstrate the power ofGraphics processing units (GPU) in ABM simulations with over 50 updates per second with agent populations exceeding 2 million.[9]
Another implementation can be found written inMathematica.[10]
GMU'sMASON project, available under theAcademic Free License, also includes an implementation of Sugarscape.[11]