Skip to content

Latest commit

 

History

History
313 lines (265 loc) · 14.3 KB

README.md

File metadata and controls

313 lines (265 loc) · 14.3 KB

AxelrodExamples

Strategy visualizations and example tournaments for the iterated Prisoner's Dilemma library Axelrod.

Strategy Visualizations

The first strategy visualization displays how often a strategy cooperates with every other strategy per round, averaged over many interactions (~200 repeated games between every pair of strategies).

Cooperation Rate Heatmaps

ZDGTFT2

Left: no noise | Right: 5% noise

Cooperation Rate Heatmap Cooperation Rate Heatmap with 5% noise

Calculator

Left: no noise | Right: 5% noise

Cooperation Heatmap Cooperation Heatmap with 5% noise

As you can see, the introduction of noise alters the efficacy of Calculator's cycle detection algorithm.

Average Score Heatmaps

We can also visualize the average payoff per round earned by each strategy versus every other strategy per round, averaged over many interactions (~200 repeated games between every pair of strategies).

Alternator

Left: no noise | Right: 5% noise

Average Score Heatmap Average Score Heatmap with 5% noise

Evolved ANN 5 Noise 05

Mean Score Heatmap


Left: no noise | Right: 5% noise

Mean Score Heatmap Mean Score Heatmap with 5% noise

All Strategies Heatmaps

Click to see all the renderings for each strategy.

Example Tournaments

See the python script example_tournaments.py for the exact details of each tournament.

All Fair Strategies

This tournament covers all strategies in the Axelrod library that follow the standard Axelrod rules.

Score Distributions


Left: no noise | Right: 5% noise

Win Distributions


Left: no noise | Right: 5% noise

Pairwise Payoffs


Left: no noise | Right: 5% noise

Tournaments

Click to see all the renderings for each tournament.