Computational Model Library

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 1 of 1 results relative agreement (ra) clear search

This entry provides an Agent-Based Model (ABM) of opinion and tolerance dynamics in artificial societies, implemented in the frame of the Concord/Partial Antagonism (C/PA) model. This version is specifically designed to investigate the impact of asymmetric influence through two leadership archetypes—Dictator and Democrat—within networked societies.
The model is highly modular, allowing the user to simulate three distinct social scenarios:
Baseline C/PA: Self-organization of a society without external influence.
Stubborn Leadership: Introduction of a “solid conviction” leader (Dictator or Democrat) who exerts constant pressure without changing their own stance.
Feedback Leadership: A democratic leader receptive to social feedback, where the leader’s opinion evolves based on interactions with the population.
Theoretical Foundations:

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.
Accept