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 11 results thresholds clear search
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.
…
The model is an agent-based artificial stock market where investors connect in a dynamic network. The network is dynamic in the sense that the investors, at specified intervals, decide whether to keep their current adviser (those investors they receive trading advise from). The investors also gain information from a private source and share public information about the risky asset. Investors have different tendencies to follow the different information sources, consider differing amounts of history, and have different thresholds for investing.
An agent-based model is used to simulate legislators’ behavior under secret voting rules, as influenced by the power of the accused politician, the composition of the voting body, and the publicity of the accusations.
We use a threshold model to drive our simulated network analysis testing public support for candidates in invisible primaries. We assign voter thresholds for candidates and vary number of voters, attachment to candidates and decay. Results of the algorithm show effects of size of lead, attachment and size of decay.
The Groundwater Commons Game synthesises and extends existing work on human cooperation and collective action, to elucidate possible determinants and pathways to regulatory compliance in groundwater systems globally.
An Agent-based model simulates consumer demand for Smart Metering tariffs. It utilizes the Bass Diffusion Model and Rogers´s adopter categories. Integration of empirical census microdata enables a validated socio-economic background for each consumer.
This NetLogo model implements the Walk Away strategy in a spatial public goods game, where individuals have the ability to leave groups with insufficient levels of cooperation.
NetLogo implementation of Linear Threshold model of influence propagation.
Due to teacher requests to represent changes in atomic radius, we developed a visualization of the first 36 elements in Netlogo
Several taxonomies for empirical validation have been published. Our model integrates different methods to calibrate an innovation diffusion model, ranging from simple randomized input validation to complex calibration with the use of microdata.
Displaying 10 of 11 results thresholds clear search