Computational Model Library

Gender differentiation model

Sylvie Huet | Published Mon Apr 20 16:01:40 2020 | Last modified Thu Apr 23 08:12:47 2020

This is a gender differentiation model in terms of reputations, prestige and self-esteem (presented in the paper The model is based on the influence function of the Leviathan model (Deffuant, Carletti, Huet 2013 and Huet and Deffuant 2017) considering two groups.

This agent-based model studies how inequalities can be explained by the difference of open-mindness between two groups of interacting agents. We consider agents having an opinion/esteem about each other and about themselves. During dyadic meetings, agents change their respective opinion about each other and possibly about other agents they gossip about, with a noisy perception of the opinions of their interlocutor. Highly valued agents are more influential in such encounters. We study an heterogeneous population of two different groups: one more open to influence of others, taking less into account their perceived difference of esteem, called L; a second one less prone to it, called S, who designed the credibility they give to others strongly based on how higher or lower valued than themselves they perceive them.

We show that a mixed population always turns in favor to some agents belonging to the group of less open-minded agents S, and harms the other group: (1) the average group self-opinion or reputation of S is always better than the one of L; (2) the higher rank in terms of reputation are more frequently occupied by the S agents while the L agents occupy more the bottom rank; (3) the properties of the dynamics of differentiation between the two groups are similar to the properties of the glass ceiling effect proposed by Cotter et al (2001).

This repository contains the replication materials for the JASSS submission: ‘Indirect Reciprocity with Contagious Reputation in Large-Scale Small-World Networks’. Further detail on how to run the models is provided in README.txt.

Peer reviewed Modelling the Social Complexity of Reputation and Status Dynamics

André Grow Andreas Flache | Published Wed Feb 1 19:23:32 2017 | Last modified Wed Jan 23 16:46:42 2019

The purpose of this model is to illustrate the use of agent-based computational modelling in the study of the emergence of reputation and status beliefs in a population.

A first version of a model that describes how coalitions are formed during open, networked innovation

Evolution of indirect reciprocity by social information

Yunhwan Kim | Published Fri Nov 2 18:14:20 2012 | Last modified Sat Apr 27 20:18:32 2013

Indirect reciprocity can be evolved by the shared information among the people of small subgroups in the population.

Dynamic bipartite network model of agents and games in which agents can participate in multiple public goods games.

In-group favoritism due to friend selection strategies based on fixed tag and within-group reputation

Yutaka Nakai | Published Fri Mar 28 12:34:55 2014 | Last modified Fri Mar 28 12:41:40 2014

An agent-based model simulates emergence of in-group favoritism. Agents adopt friend selection strategies using an invariable tag and reputations meaning how cooperative others are to a group. The reputation can be seen as a kind of public opinion.


P Dykstra | Published Wed Nov 28 21:13:27 2012 | Last modified Sat Apr 27 20:18:30 2013

DIAL is a model of group dynamics and opinion dynamics. It features dialogues, in which agents put their reputation at stake. Intra-group radicalisation of opinions appears to be an emergent phenomenon.

Modeling financial networks based on interpersonal trust

Anna Klabunde Michael Roos | Published Wed May 29 14:28:45 2013 | Last modified Thu Nov 28 12:31:40 2013

We build a stylized model of a network of business angel investors and start-up entrepreneurs. Decisions are based on trust as a decision making tool under true uncertainty.

This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.