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.
| Version: | 1.1.3.2 |
| Depends: | R (≥ 3.4.0) |
| Imports: | grDevices (≥ 3.4.0), graphics (≥ 3.4.0), stats (≥ 3.4.0), shiny (≥ 1.0.0) |
| Suggests: | testthat |
| Published: | 2017-06-13 |
| Author: | person("A. Bradley", "Duthie", email = "brad.duthie@gmail.com", role = c("aut", "cre")) |
| Maintainer: | A. Bradley Duthie <alexander.duthie at stir.ac.uk> |
| BugReports: | https://github.com/bradduthie/gamesGA/issues |
| License: | MIT + file LICENSE |
| URL: | https://bradduthie.github.io/gamesGA/ |
| NeedsCompilation: | yes |
| CRAN checks: | gamesGA results |
| Reference manual: | gamesGA.pdf |
| Package source: | gamesGA_1.1.3.2.tar.gz |
| Windows binaries: | r-devel: gamesGA_1.1.3.2.zip, r-release: gamesGA_1.1.3.2.zip, r-oldrel: not available |
| OS X El Capitan binaries: | r-release: gamesGA_1.1.3.2.tgz |
| OS X Mavericks binaries: | r-oldrel: not available |
Please use the canonical form https://CRAN.R-project.org/package=gamesGA to link to this page.