Computational Model Library

Displaying 4 of 4 results behavioral game theory clear search

This project combines game theory and genetic algorithms in a simulation model for evolutionary learning and strategic behavior. It is often observed in the real world that strategic scenarios change over time, and deciding agents need to adapt to new information and environmental structures. Yet, game theory models often focus on static games, even for dynamic and temporal analyses. This simulation model introduces a heuristic procedure that enables these changes in strategic scenarios with Genetic Algorithms. Using normalized 2x2 strategic-form games as input, computational agents can interact and make decisions using three pre-defined decision rules: Nash Equilibrium, Hurwicz Rule, and Random. The games then are allowed to change over time as a function of the agent’s behavior through crossover and mutation. As a result, strategic behavior can be modeled in several simulated scenarios, and their impacts and outcomes can be analyzed, potentially transforming conflictual situations into harmony.

This is an agent-based model of the implementation of the self-enforcing agreement in cooperative teams.

MASTOC - A Multi-Agent System of the Tragedy Of The Commons

Julia Schindler | Published Tuesday, November 30, 2010 | Last modified Saturday, April 27, 2013

MASTOC is a replication of the Tragedy of the Commons by G. Hardin, programmed in NetLogo 4.0.4, based on behavioral game theory and Nash solution.

A Model of Iterated Ultimatum game

Andrea Scalco | Published Tuesday, February 24, 2015 | Last modified Monday, March 09, 2015

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.

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