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 296 results for "Shu-Heng Chen" clear search
This is a simple model replicating Hardin’s Tragedy of the Commons using reactive agents that have psychological behavioral and social preferences.
Indirect reciprocity can be evolved by the shared information among the people of small subgroups in the population.
This model represents an agent-based social simulation for citizenship competences. In this model people interact by solving different conflicts and a conflict is solved or not considering two possible escenarios: when individual citizenship competences are considered and when not. In both cases the TKI conflict resolution styles are considered. Each conflict has associated a competence and the information about the conflicts and their competences is retrieved from an ontology which was developed in Protégé. To do so, a NetLogo extension was developed using the Java programming language and the JENA API (to make queries over the ontology).
We used a computer simulation to measure how well different network structures (fully connected, small world, lattice, and random) find and exploit resource peaks in a variable environment.
This is a relatively simple foraging-radius model, as described first by Robert Kelly, that allows one to quantify the effect of increased logistical mobility (as represented by increased effective foraging radius, r_e) on the likelihood that 2 randomly placed central place foragers will encounter one another within 5000 time steps.
The model explores food distribution patterns that emerge in a small-scale non-agricultural group when sharing individuals engage in intentional consumption leveling with a given probability.
Agent-based model of hunting behavior of Ache hunter-gatherers from Paraguay. We evaluate the effect of group size and cooperative hunting
This model is designed to show the effects of personality types and student organizations have on ones chance to making friendships in a university setting. As known from psychology studies, those that are extroverted have an easier chance making friendships in comparison to those that are introverted.
Once every tick a pair of students (nodes) will be randomly selected they will then have the chance to either be come friends or not (create an edge or not) based on their personality type (you are able to change what the effect of each personality is) and whether or not they are in the same club (you can change this value) then the model triggers the next tick cycle to begin.
The model explores the possibility of the evolution of cooperation due to indirect reciprocity when agents derive information about the past behavior of the opponent in one-shot dilemma games.
We provide an agent-based model of collective action, informed by Granovetter (1978) and its replication model by Siegel (2009). We use the model to examine the role of ICTs in collective action under different cultural and political contexts.
Displaying 10 of 296 results for "Shu-Heng Chen" clear search