Our mission is to help computational modelers develop, document, and share their computational models in accordance with community standards and good open science and software engineering practices. Model authors can publish their model source code in the Computational Model Library with narrative documentation as well as metadata that supports open science and emerging norms that facilitate software citation, computational reproducibility / frictionless reuse, and interoperability. Model authors can also request private peer review of their computational models. Models that pass peer review receive a DOI once published.
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 feel free to contact us if you have any questions or concerns about publishing your model(s) in the Computational Model Library.
Displaying 10 of 1150 results for "Sjoukje A Osinga" clear search
MigrAgent simulates migration flows of a population from a home country to a host country and mutual adaptation of a migrant and local population post-migration. Agents accept interactions in intercultural networks depending on their degree of conservatism. Conservatism is a group-level parameter normally distributed within each ethnic group. Individual conservatism changes as function of reciprocity of interaction in intergroup experiences of acceptance or rejection.
The aim of MigrAgent is to unfold different outcomes of integration, assimilation, separation and marginalization in terms of networks as effect of different degrees of conservatism in each group and speed of migration flows.
This model converts cleaned up versions of .pgn files (records of real chess games) and conversts them into files that record all of the events and “possible” events within a game of chess. This is intended to be a way to create sets of data that capture event sequences within the relatively complex but finite context of chess games as a proxy or “toy” data set. Although not a perfect correlation, these toy data sets are a first step in analysing complex and dynamic systems of events and possible events that happen in the real world.
How do bots influence beliefs on social media? Why do beliefs propagated by social bots spread far and wide, yet does their direct influence appear to be limited?
This model extends Axelrod’s model for the dissemination of culture (1997), with a social bot agent–an agent who only sends information and cannot be influenced themselves. The basic network is a ring network with N agents connected to k nearest neighbors. The agents have a cultural profile with F features and Q traits per feature. When two agents interact, the sending agent sends the trait of a randomly chosen feature to the receiving agent, who adopts this trait with a probability equal to their similarity. To this network, we add a bot agents who is given a unique trait on the first feature and is connected to a proportion of the agents in the model equal to ‘bot-connectedness’. At each timestep, the bot is chosen to spread one of its traits to its neighbors with a probility equal to ‘bot-activity’.
The main finding in this model is that, generally, bot activity and bot connectedness are both negatively related to the success of the bot in spreading its unique message, in equilibrium. The mechanism is that very active and well connected bots quickly influence their direct contacts, who then grow too dissimilar from the bot’s indirect contacts to quickly, preventing indirect influence. A less active and less connected bot leaves more space for indirect influence to occur, and is therefore more successful in the long run.
This model is based on Joshua Epstein’s (2001) model on development of thoughtless conformity in an artificial society of agents.
This is a model that explores how a few fishermen sharing a common fishery learn their harvesting strategies under different incentive settings, and how individual greed, cooperation, and sustainability penalties shape resource depletion and the tragedy of the commons.
A replication of the model “Trust, Cooperation and Market Formation in the U.S. and Japan” by Michael W. Macy and Yoshimichi Sato.
The model measures drivers of effectiveness of risk assessments in risk workshops regarding the correctness and required time. Specifically, we model the limits to information transfer, incomplete discussions, group characteristics, and interaction patterns and investigate their effect on risk assessment in risk workshops.
The model simulates a discussion in the context of a risk workshop with 9 participants. The participants use Bayesian networks to assess a given risk individually and as a group.
We develop an agent-based model for collective behavior of routine medical check-ups, and specifically dental visits, in a social network.
A model for simulating the evolution of individual’s preferences, incliding adaptive agents “falsifying” -as public opinions- their own preferences. It was builded to describe, explore, experiment and understand how simple heuristics can modulate global opinion dynamics. So far two mechanisms are implemented: a version of Festiguer’s reduction of cognitive disonance, and a version of Goffman’s impression management. In certain social contexts -minority, social rank presure- some models agents can “fake” its public opinion while keeping internally the oposite preference, but after a number of rounds following this falsifying behaviour pattern, a coherence principle can change the real or internal preferences close to that expressed in public.
This computational model accompanies the article “The Informational Assumptions of Schelling Segregation: An Agent-Based Decomposition of Cue Inference, Cultural Schemas, and Residential Sorting.” It implements an agent-based model in which agents infer latent neighborhood-type classes from noisy non-demographic cues through schema-specific diagnostic mappings, update beliefs, and relocate when satisfaction on a preferred latent class falls below a threshold.
The model serves as a mechanism-isolation device for studying the informational architecture underlying Schelling-style residential sorting. It includes the principal sweep configuration (14,400 runs across a seven-parameter grid), a disagreement-metric sub-sweep with permutation-minimized Jensen-Shannon divergence recorded natively, controls (positive, negative, and frozen-belief), a paired-seed cue-channel perturbation experiment, and selected-cell sensitivity sweeps for cue persistence and home-biased mobility.
The full ODD protocol, parameter manifests, deterministic seed schedules, processed outputs, regenerable figure scripts, the verification test suite, and the satisfaction-mapping audit document are included. Every reported run is deterministic given a (config, seed) pair, and an included audit script verifies bit-for-bit replay on sampled runs.
Displaying 10 of 1150 results for "Sjoukje A Osinga" clear search