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 10 of 41 results for "Renaud Bourlès" clear search

Informal risk-sharing cooperatives : ORP and Learning

Juliette Rouchier Victorien Barbet Renaud Bourlès | Published Monday, February 13, 2017 | Last modified Tuesday, May 16, 2023

The model studies the dynamics of risk-sharing cooperatives among heterogeneous farmers. Based on their knowledge on their risk exposure and the performance of the cooperative farmers choose whether or not to remain in the risk-sharing agreement.

This model implements a classic scenario used in Reinforcement Learning problem, the “Cliff Walking Problem”. Consider the gridworld shown below (SUTTON; BARTO, 2018). This is a standard undiscounted, episodic task, with start and goal states, and the usual actions causing movement up, down, right, and left. Reward is -1 on all transitions except those into the region marked “The Cliff.” Stepping into this region incurs a reward of -100 and sends the agent instantly back to the start (SUTTON; BARTO, 2018).

CliffWalking

The problem is solved in this model using the Q-Learning algorithm. The algorithm is implemented with the support of the NetLogo Q-Learning Extension

MOSAIC is an agent-based NetLogo model of decentralized mission coordination among heterogeneous robots operating under partial observability, limited energy, spatially variable risk, dynamic communication, and individual and cooperative task requirements. Robots discover tasks locally, exchange task information through temporary communication links, submit capability-, energy-, deadline-, and risk-aware bids, compete for individual contracts, and form temporary coalitions for cooperative tasks.

The model integrates decentralized auctions, greedy capability-based coalition formation, contract release and reassignment, four reward regimes, reputation, adaptive bidding strategies, failure traceability, and mission-, network-, information-, inequality-, and coalition-level metrics. It operates without a centralized mission planner or global combinatorial assignment solver.

Seven paired-seed BehaviorSpace experiments comprising 690 official simulation runs evaluate baseline mission viability, reward regimes, communication structure, capability heterogeneity, cooperative-task demand, reputation and adaptive strategies, and mission-incentive strength. The results indicate that structural coordination capacity—particularly information reach, capability compatibility, and feasible coalition construction—has a stronger effect on mission completion than increasing incentive intensity within the tested architecture and parameter ranges.

PredPreyGrass

HBP1969 | Published Sunday, May 17, 2026

Exploring learned cooperation, coevolution and free-riding. Learning is achieved through Multi-Agent Deep Reinforcement Learning (MADRL) in an ecological environment. The environment emits no other than sparse reproduction rewards. No reward shaping, no explicit cooperation signal.

Spatial model of the noisy Prisoner's Dilemma with reward shift

Matus Halas | Published Thursday, March 05, 2015 | Last modified Tuesday, May 29, 2018

Interactions of players embedded in a closed square lattice are determined by distance and overall gains and they lead to shifts of reward payoff between temptation and punishment. A new winner balancing against threats is ultimately discovered.

Package for simulating the behavior of experts in a scientific-forecasting competition, where the outcome of experiments itself depends on expert consensus. We pay special attention to the interplay between expert bias and trust in the reward algorithm. The package allows the user to reproduce results presented in arXiv:2305.04814, as well as testing of other different scenarios.

The aim of this model is to explore and understand the factors driving adoption of treatment strategies for ecological disturbances, considering payoff signals, learning strategies and social-ecological network structure

Equity Constrained Dispatching Model of Emergency Medical Services

Sreekanth V K Ram Babu Roy | Published Thursday, September 08, 2016 | Last modified Monday, May 01, 2017

Model for evaluating various ambulance dispatching policies of an equity constrained emergency medical services under bounded rationality.

Battle of Perspectives

Marco Janssen Bert Devries | Published Monday, December 02, 2013

How does the world population adapt its policies on energy when it is confronted with a climate change? This model combines a climate-economy model with adaptive agents.

Displaying 10 of 41 results for "Renaud Bourlès" clear search

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