CoMSES Net maintains cyberinfrastructure to foster FAIR data principles for access to and (re)use of computational models. Model authors can publish their model code in the Computational Model Library with documentation, metadata, and data dependencies and support these FAIR data principles as well as best practices for software citation. Model authors can also request that their model code be peer reviewed to receive a DOI. All users of models published in the library must cite model authors when they use and benefit from their code.
CoMSES Net also maintains a curated database of over 7500 publications of agent-based and individual based models with additional metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
The Urban Traffic Simulator is an agent-based model developed in the Unity platform. The model allows the user to simulate several autonomous vehicles (AVs) and tune granular parameters such as vehicle downforce, adherence to speed limits, top speed in mph and mass. The model allows researchers to tune these parameters, run the simulator for a given period and export data from the model for analysis (an example is provided in Jupyter Notebook).
The data the model is currently able to output are the following:
PopComp by Andre Costopoulos 2020
Licence: DWYWWI (Do whatever you want with it)
I use Netlogo to build a simple environmental change and population expansion and diffusion model. Patches have a carrying capacity and can host two kinds of populations (APop and BPop). Each time step, the carrying capacity of each patch has a given probability of increasing or decreasing up to a maximum proportion.
Modeling an economy with stable macro signals, that works as a benchmark for studying the effects of the agent activities, e.g. extortion, at the service of the elaboration of public policies..
Implementation of Milbrath’s (1965) model of political participation. Individual participation is determined by stimuli from the political environment, interpersonal interaction, as well as individual characteristics.
The purpose of this model is explore how “friend-of-friend” link recommendations, which are commonly used on social networking sites, impact online social network structure. Specifically, this model generates online social networks, by connecting individuals based upon varying proportions of a) connections from the real world and b) link recommendations. Links formed by recommendation mimic mutual connection, or friend-of-friend algorithms. Generated networks can then be analyzed, by the included scripts, to assess the influence that different proportions of link recommendations have on network properties, specifically: clustering, modularity, path length, eccentricity, diameter, and degree distribution.
The rapid environmental changes currently underway in many dry regions of the world, and the deep uncertainty about their consequences, underscore a critical challenge for sustainability: how to maintain cooperation that ensures the provision of natural resources when the benefits of cooperating are variable, sometimes uncertain, and often limited. We present an agent-based model that simulates the economic decisions of households to engage, or not, in labor-sharing agreements under different scenarios of water supply, water variability, and socio-environmental risk. We formulate the model to investigate the consequences of environmental variability on the fate of labor-sharing agreements between farmers. The economic decisions were implemented in the framework of prospect theory.
Flibs’NLogo implements in NetLogo modelling environment, a genetic algorithm whose purpose is evolving a perfect predictor from a pool of digital creatures constituted by finite automata or flibs (finite living blobs) that are the agents of the model. The project is based on the structure described by Alexander K. Dewdney in “Exploring the field of genetic algorithms in a primordial computer sea full of flibs” from the vintage Scientific American column “Computer Recreations”
As Dewdney summarized: “Flibs […] attempt to predict changes in their environment. In the primordial computer soup, during each generation, the best predictor crosses chromosomes with a randomly selected flib. Increasingly accurate predictors evolve until a perfect one emerges. A flib […] has a finite number of states, and for each signal it receives (a 0 or a 1) it sends a signal and enters a new state. The signal sent by a flib during each cycle of operation is its prediction of the next signal to be received from the environment”
This model aims to simulate Competition and Displacement of Online Interpersonal Communication Platforms process from a bottom-up angle. Individual interpersonal communication platform adoption and abandonment serve as the micro-foundation of the simulation model. The evolution mode of platform user online communication network determines how present platform users adjust their communication relationships as well as how new users join that network. This evolution mode together with innovations proposed by individual interpersonal communication platforms would also have impacts on the platform competition and displacement process and result by influencing individual platform adoption and abandonment behaviors. Three scenes were designed to simulate some common competition situations occurred in the past and current time, that two homogeneous interpersonal communication platforms competed with each other when this kind of platforms first came into the public eye, that a late entrant platform with a major innovation competed with the leading incumbent platform during the following days, as well as that both the leading incumbent and the late entrant continued to propose many small innovations to compete in recent days, respectively.
Initial parameters are as follows: n(Nmax in the paper), denotes the final node number of the online communication network node. mi (m in the paper), denotes the initial degree of those initial network nodes and new added nodes. pc(Pc in the paper), denotes the proportion of links to be removed and added in each epoch. pst(Pv in the paper), denotes the proportion of nodes with a viscosity to some platforms. comeintime(Ti in the paper), denotes the epoch when Platform 2 joins the market. pit(Pi in the paper), denotes the proportion of nodes adopting Platform 2 immediately at epoch comeintime(Ti). ct(Ct in the paper), denotes the Innovation Effective Period length. In Scene 2, There is only one major platform proposed by Platform 2, and ct describes that length. However, in Scene 3, Platform 2 and 1 will propose innovations alternately. And so, we set ct=10000 in simulation program, and every jtt epochs, we alter the innovation proposer from one platform to the other. Hence in this scene, jtt actually denotes the Innovation Effective Period length instead of ct.
In a two-level hierarchical structure (consisting of the positions of managers and operators), persons holding these positions have a certain performance and the value of their own (personal perception in this, simplified, version of the model) perception of each other. The value of the perception of each other by agents is defined as a random variable that has a normal distribution (distribution parameters are set by the control elements of the interface).
In the world of the model, which is the space of perceptions, agents implement two strategies: rapprochement with agents that perceive positively and distance from agents that perceive negatively (both can be implemented, one of these strategies, or neither, the other strategy, which makes the agent stationary). Strategies are implemented in relation to those agents that are in the radius of perception (PerRadius).
The manager (Head) forms a team of agents. The performance of the group (the sum of the individual productivities of subordinates, weighted by the distance from the leader) varies depending on the position of the agents in space and the values of their individual productivities. Individual productivities, in the current version of the model, are set as a random variable distributed evenly on a numerical segment from 0 to 100. The manager forms the team 1) from agents that are in (organizational) radius (Op_Radius), 2) among agents that the manager perceives positively and / or negatively (both can be implemented, one of the specified rules, or neither, which means the refusal of the command formation).
Agents can (with a certain probability, given by the variable PrbltyOfDecisn%), in case of a negative perception of the manager, leave his group permanently.
It is possible in the model to change on the fly radii values, update the perception value across the entire population and the perception of an individual agent by its neighbors within the perception radius, and the probability values for a subordinate to make a decision about leaving the group.
You can also change the set of strategies for moving agents and strategies for recruiting a team manager. It is possible to add a randomness factor to the movement of agents (Stoch_Motion_Speed, the default is set to 0, that is, there are no random movements).
This model is an extended version of the original MERCURY model (https://www.comses.net/codebases/4347/releases/1.1.0/ ) . It allows for experiments to be performed in which empirically informed population sizes of sites are included, that allow for the scaling of the number of tableware traders with the population of settlements, and for hypothesised production centres of four tablewares to be used in experiments.
Experiments performed with this population extension and substantive interpretations derived from them are published in:
Hanson, J.W. & T. Brughmans. In press. Settlement scale and economic networks in the Roman Empire, in T. Brughmans & A.I. Wilson (ed.) Simulating Roman Economies. Theories, Methods and Computational Models. Oxford: Oxford University Press.