C++ and Netlogo models presented in G. Bravo (2011), “Agents’ beliefs and the evolution of institutions for common-pool resource management”. Rationality and Society 23(1).

This repository the multi-agent simulation software for the paper “Comparison of Competing Market Mechanisms with Reinforcement Learning in a CarPooling Scenario”. It’s a mutlithreaded Javaapplication.

The BENCH agent-based model is designed and developed to study shifts in residential energy use and corresponding emissions driven by behavioral changes among heterogeneous individuals.

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

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

Demo model that shows how continuous opinions change due to interactions with other agents. Agents move towards similar opinions and repel away from intolerable opinions.

3 simple models to illustrate diffusion of innovations.
The models are discussed in Introduction to Agent-Based Modeling by Marco Janssen. For more information see https://intro2abm.com/

This is based off my previous Profiler tutorial model, but with an added tutorial on converting it into a model usable with BehaviorSpace, and creating a BehaviorSpace experiment.

A discrete-time stochastic model with state-dependent transmission probabilities and multi-agent simulations focusing on possible risks that could materialize in the final phase of the epidemic.

Party Competition with Costly Voting builds upon the baseline model in Chapter 5 from Laver and Sergenti’s Party Competition (2011); it adds voting costs to generate variable turnout.

Hierarchical problem-solving model
The model simulates a hierarchical problem-solving process in which a manager delegates parts of a problem to specialists, who attempt to solve specific aspects based on their unique skills. The goal is to examine how effectively the hierarchical structure works in solving the problem, the total cost of the process, and the resulting solution quality.

Problem-solving random network model
The model simulates a network of agents (generalists) who collaboratively solve a fixed problem by iterating over it and using their individual skills to reduce the problem’s complexity. The goal is to study the dynamics of the problem-solving process, including agent interactions, work cycles, total cost, and solution quality.