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.
Here we share the raw results of the social experiments of the paper “Gossip and competitive altruism support cooperation in a Public Good Game” by Giardini, Vilone, Sánchez, Antonioni, under review for Philosophical Transactions B. The experiment is thoroughly described there, in the following we summarize the main features of the experimental setup. The authors are available for further clarifications if requested.
Participants were recruited from the LINEEX subjects pool (University of Valencia Experimental Economics lab). 160 participants mean age = 21.7 years; 89 female) took part in this study in return for a flat payment of 5 EUR and the opportunity to earn an additional payment ranging from 8 to 16 EUR (mean total payment = 17.5 EUR). 80 subjects, divided into 5 groups of 16, took part in the competitive treatment while other 80 subjects participated in the non-competitive treatment. Laboratory experiments were conducted at LINEEX on September 16th and 17th, 2015.
IOP 2.1.2 is an agent-based simulation model designed to explore the relations between (1) employees, (2) tasks and (3) resources in an organizational setting. By comparing alternative cognitive strategies in the use of resources, employees face increasingly demanding waves of tasks that derive by challenges the organization face to adapt to a turbulent environment. The assumption tested by this model is that a successful organizational adaptation, called plastic, is necessarily tied to how employees handle pressure coming from existing and new tasks. By comparing alternative cognitive strategies, connected to ‘docility’ (Simon, 1993; Secchi, 2011) and ‘extended’ cognition (Clark, 2003, Secchi & Cowley, 2018), IOP 2.1.2 is an attempt to indicate which strategy is most suitable and under which scenario.
In the model agents make decisions to contribute of not to the public good of a group, and cooperators may punish, at a cost, defectors. The model is based on group selection, and is used to understan
In order to test how prosocial strategies (compassionate altruism vs. reciprocity) grow over time, we developed an evolutionary simulation model where artificial agents are equipped with different emotionally-based drivers that vary in strength. Evolutionary algorithms mimic the evolutionary selection process by letting the chances of agents conceiving offspring depend on their fitness. Equipping the agents with heritable prosocial strategies allows for a selection of those strategies that result in the highest fitness. Since some prosocial attributes may be more successful than others, an initially heterogeneous population can specialize towards altruism or reciprocity. The success of particular prosocial strategies is also expected to depend on the cultural norms and environmental conditions the agents live in.
This abstract model explores the emergence of altruistic behavior in networked societies. The model allows users to experiment with a number of population-level parameters to better understand what conditions contribute to the emergence of altruism.
The simulation generates two kinds of agents, whose proposals are generated accordingly to their selfish or selfless behaviour. Then, agents compete in order to increase their portfolio playing the ultimatum game with a random-stranger matching.