Our mission is to help computational modelers at all levels engage in the establishment and adoption of community standards and good practices for developing and sharing computational models. Model authors can freely publish their model source code in the Computational Model Library alongside narrative documentation, open science metadata, and other emerging open science norms that facilitate software citation, reproducibility, interoperability, and reuse. Model authors can also request peer review of their computational models to receive a DOI.
All users of models published in the library must cite model authors when they use and benefit from their code.
Please check out our model publishing tutorial and contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.
We also maintain a curated database of over 7500 publications of agent-based and individual based models with additional detailed metadata on availability of code and bibliometric information on the landscape of ABM/IBM publications that we welcome you to explore.
Displaying 10 of 1066 results for "Joan A Barceló" clear search
The purpose of the model is to study the impact of global food trade on food and nutrition security in countries around the world. It will incorporate three main aspects of trade between countries, including a country’s wealth, geographic location, and its trade relationships with other countries (past and ongoing), and can be used to study food and nutrition security across countries in various scenarios, such as climate change, sustainable intensification, waste reduction and dietary change.
This is the model for a paper that is based on a simulation model, programmed in Netlogo, that demonstrates changes in market structure that occur as marginal costs, demand, and barriers to entry change. Students predict and observe market structure changes in terms of number of firms, market concentration, market price and quantity, and average marginal costs, profits, and markups across the market as firms innovate. By adjusting the demand growth and barriers to entry, students can […]
Schelling famously proposed an extremely simple but highly illustrative social mechanism to understand how strong ethnic segregation could arise in a world where individuals do not necessarily want it. Schelling’s simple computational model is the starting point for our extensions in which we build upon Wilensky’s original NetLogo implementation of this model. Our two NetLogo models can be best studied while reading our chapter “Agent-based Computational Models” (Flache and de Matos Fernandes, 2021). In the chapter, we propose 10 best practices to elucidate how agent-based models are a unique method for providing and analyzing formally precise, and empirically plausible mechanistic explanations of puzzling social phenomena, such as segregation, in the social world. Our chapter addresses in particular analytical sociologists who are new to ABMs.
In the first model (SegregationExtended), we build on Wilensky’s implementation of Schelling’s model which is available in NetLogo library (Wilensky, 1997). We considerably extend this model, allowing in particular to include larger neighborhoods and a population with four groups roughly resembling the ethnic composition of a contemporary large U.S. city. Further features added concern the possibility to include random noise, and the addition of a number of new outcome measures tuned to highlight macro-level implications of the segregation dynamics for different groups in the agent society.
In SegregationDiscreteChoice, we further modify the model incorporating in particular three new features: 1) heterogeneous preferences roughly based on empirical research categorizing agents into low, medium, and highly tolerant within each of the ethnic subgroups of the population, 2) we drop global thresholds (%-similar-wanted) and introduce instead a continuous individual-level single-peaked preference function for agents’ ideal neighborhood composition, and 3) we use a discrete choice model according to which agents probabilistically decide whether to move to a vacant spot or stay in the current spot by comparing the attractiveness of both locations based on the individual preference functions.
…
ReSolEvo File output version
A general model of human mate choice in which agents are localized in space, interact with close neighbors, and tend to range either near or far. At the individual level, our model uses two oft-used but incompletely understood decision rules: one based on preferences for similar partners, the other for maximally attractive partners.
This is the R code of the mathematical model that includes the decision making formulations for artificial agents. This code corresponds to equations 1-70 given in the paper “A Mathematical Model of The Beer Game”.
This is a model of coherency based belief within a dynamic network of individuals. Described in an invited talk on workshop on Coherence, Berlin, 9th July 2016.
The model simulates agents in a spatial environment competing for a common resource that grows on patches. The resource is converted to energy, which is needed for performing actions and for surviving.
Ge, J., & Polhill, G. (2016). Exploring the Combined Impact of Factors Influencing Commuting Patterns and CO2 Emission in Aberdeen Using an Agent-Based Model. Journal of Artificial Societies and Social Simulation, 19(3). http://jasss.soc.surrey.ac.uk/19/3/11.html
We develop an agent-based transport model using a realistic GIS-enabled road network and the car following method. The model can be used to study the impact of social interventions such as flexi-time and workplace sharing, as well as large infrastructure such as the construction of a bypass or highway. The model is developed in Netlogo version 5 and requires road network data in GIS format to run.
In the consumer advice network, users with connections can interact with each other, and the network topology will change during the opinion interaction. When the opinion distance from i to j is greater than the confidence threshold, the two consumers cannot exchange opinions, and the link between them will disconnect with probability DE. Then, a link from node i to node k is established with probability CE and node i learning opinion from node k.
Displaying 10 of 1066 results for "Joan A Barceló" clear search