This repository derives analytical conditions for strategy evolution in populations using coalescent-theory-based methods. We use the sympy module in Python to derive famous results in classic papers.
This program simulates and quantifies outcomes of parameterized prisoner’s dilemma simulation in various MAS networks. This is the third lab in the series of 3 lab projects designed to introduce Multi-Agent Systems (MAS) as a base for Machine Learning.
A Julia package for the quantum prisoner's dilemma model.
Agent-based model of multi-level group selection
🧬 Adaptive algorithm for agents participating in a variant of the iterated prisoners dilemma problem.
A prisoner's dilemma agent based model simulation for investigating effects of differing strategies on emergent behaviours and spatial patterns with configurable environments.
A practical look at the Axelrod tournament.
A minimalist multi-agent implementation of the social dilemma problem with governance kernels
Selected behavioral economics games to showcase at events for children and adolescents
Simulator of the iterated prisoner's dilemma.
Genetic Algorithm for Iterated Prisoner’s Dilemma
Python library for game theory simulations and analysis
An interactive web application that explores game theory through competitive strategy simulations in the classic Prisoner's Dilemma.
Simulator for the classical prisoner dilemma game.
An implementation of 8 competing strategies to recreate Axelrods tournament for the Iterated Prisoners Dilemma
Python code for Grim, Mar, St. Denis - The Philosophical Computer: Exploratory Essays in Philosophical Computer Modeling (1998)
Prisoner's Dilemma tournament
Little research project on CAs. Illustrative application: iterated prisoner's dilemma on a lattice (Novak-May model)
Add a description, image, and links to the prisoners-dilemma topic page so that developers can more easily learn about it.
To associate your repository with the prisoners-dilemma topic, visit your repo's landing page and select "manage topics."