Repeated Games
From Evolution and Games
| Line 17: | Line 17: | ||
== The simulation program == | == The simulation program == | ||
| - | The | + | === What are strategies? === |
| + | |||
| + | Strategies are either programmed explicitly as finite automata, as regular expressions, or as Turing machines. The set of regular expressions is equivalent to the set of finite automata, but because they are represented differently, the likelihoods of mutations also are different; a mutation that is a single step in one representation requires a series of steps in the other and vice versa. | ||
| + | |||
| + | A finite automaton is a list of states, and for every state it prescribes what the automaton plays when in that state, to which state it goes if the opponent plays cooperate, and to which state it goes if the opponent plays defect. | ||
| + | |||
| + | [[File:PictureAutomata.png]] | ||
| + | |||
| + | |||
== The paper == | == The paper == | ||
A version of the paper can be downloaded [http://www.tinbergen.nl/ti-publications/discussion-papers.php?paper=1587 here] | A version of the paper can be downloaded [http://www.tinbergen.nl/ti-publications/discussion-papers.php?paper=1587 here] | ||
| + | The online material that accompanies the paper is [http://staff.feweb.vu.nl/j.garcia/docs/RepeatedGamesOnlineMaterial.pdf here] in PDF format. | ||
Revision as of 14:07, 20 April 2010
Contents |
Run the simulations!
You can download the software here. Once the program is running just click on the big play button to start the fun. Feel free to re-arrange and re-size the windows, zoom-in and out as the program is running.
Use Java RunTime 5.0 or newer to run the software. It should be just fine if you already have java installed in your machine, just double click once you have downloaded the file, or choose open from the browser box.
Notes on using the software
- If you use the Moran process (instead of the default Wright-Fisher process) use a mutation rate that is considerably smaller than 1/populationSize so that the strength of selection is meaningful
- If you use measures (of cooperation and reciprocity) the software will run considerably slower than when not using measures.
- The parameter precisionMeasures determines how long in the history of the game will you go to compute measures of reciprocity and cooperation. Tune it to your machine's power and consider the continuation probability.
- Send us an email if you want to generate data from the software in plain files, or if you just have questions or comments (Matthijs c.m.vanveelen AT uva.nl - or - Julian j.garcia AT feweb.vu.nl).
The simulation program
What are strategies?
Strategies are either programmed explicitly as finite automata, as regular expressions, or as Turing machines. The set of regular expressions is equivalent to the set of finite automata, but because they are represented differently, the likelihoods of mutations also are different; a mutation that is a single step in one representation requires a series of steps in the other and vice versa.
A finite automaton is a list of states, and for every state it prescribes what the automaton plays when in that state, to which state it goes if the opponent plays cooperate, and to which state it goes if the opponent plays defect.
The paper
A version of the paper can be downloaded here The online material that accompanies the paper is here in PDF format.
