Finds adaptive strategies for sequential symmetric games using a genetic algorithm. Currently, any symmetric two by two matrix is allowed, and strategies can remember the history of an opponent's play from the previous three rounds of moves in iterated interactions between players. The genetic algorithm returns a list of adaptive strategies given payoffs, and the mean fitness of strategies in each generation.
|Author||person("A. Bradley", "Duthie", email = "[email protected]", role = c("aut", "cre"))|
|Date of publication||2017-06-13 21:37:07 UTC|
|Maintainer||A. Bradley Duthie <[email protected]>|
|License||MIT + file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.