{"action":"created","issue":{"url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/379","repository_url":"https://api.github.com/repos/Axelrod-Python/Axelrod","labels_url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/379/labels{/name}","comments_url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/379/comments","events_url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/379/events","html_url":"https://github.com/Axelrod-Python/Axelrod/issues/379","id":112824580,"number":379,"title":"Desired New strategies","user":{"login":"marcharper","id":203345,"avatar_url":"https://avatars.githubusercontent.com/u/203345?v=3","gravatar_id":"","url":"https://api.github.com/users/marcharper","html_url":"https://github.com/marcharper","followers_url":"https://api.github.com/users/marcharper/followers","following_url":"https://api.github.com/users/marcharper/following{/other_user}","gists_url":"https://api.github.com/users/marcharper/gists{/gist_id}","starred_url":"https://api.github.com/users/marcharper/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/marcharper/subscriptions","organizations_url":"https://api.github.com/users/marcharper/orgs","repos_url":"https://api.github.com/users/marcharper/repos","events_url":"https://api.github.com/users/marcharper/events{/privacy}","received_events_url":"https://api.github.com/users/marcharper/received_events","type":"User","site_admin":false},"labels":[{"id":181634999,"url":"https://api.github.com/repos/Axelrod-Python/Axelrod/labels/Easy_pull_request","name":"Easy_pull_request","color":"009800","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":28,"created_at":"2015-10-22T15:09:49Z","updated_at":"2017-02-04T06:20:24Z","closed_at":null,"body":"Some of these may be implemented under other names already, please ask if you are unsure! Feel free to add any new ones to the list. Note that we are happy to have original contributions as well!\r\n\r\n- Binary decision strategies defined in \"Varying Decision Inputs in Prisoner’s Dilemma\", Barlow and Ashlock 2015\r\n\r\nStrategies implemented in [PRISON](http://www.lifl.fr/IPD/ipd.frame.html) (look in `classics.str`):\r\n- soft_spiteful\r\n- slow_tft\r\n- better_and_better\r\n- ~~worse_and_worse2~~, ~~worse_and_worse3~~\r\n  and see [this paper](http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1665.pdf)\r\n- ~~winner12~~ ~~winner 21~~\r\n- spiteful_cc\r\n- ~~mem2~~\r\n- gradual_killer [Already done on another name?]\r\n- soft_tf2t [TF2T?]\r\n- Others from the library that you find interesting.\r\n- Done: ~~c_then_per_dc~~,  ~~doubler~~, ~~easy_go~~, ~~gradual~~, ~~per_ddc~~, ~~per_cccdcd~~, ~~prober4~~, ~~tft_spiteful~~, ~~worse_and_worse~~\r\n\r\nFrom [CoopSim](https://github.com/jecki/CoopSim):\r\n- ~~ContriteTFT~~\r\n- TwoTitsForTwoTats -- and the generalization to NTitsForMTats\r\n- Others that you find interesting\r\n\r\nMany strategies in [this paper](http://abricom.org.br/wp-content/uploads/2016/03/bricsccicbic2013_submission_202.pdf) are not yet in the library:\r\n\r\nFrom \"Exploiting Evolutionary Modeling to Prevail in Iterated Prisoner’s Dilemma Tournaments\":\r\n- Laran\r\n- Turan\r\n- [Tages](https://bitbucket.org/squillero/tages)\r\n\r\nFrom [this page](http://www.prisoners-dilemma.com/strategies.html) (see also [the bibliography](http://www.prisoners-dilemma.com/bibliography.html)) for the 20th anniversary tournament:\r\n- ~~Soft Grudger~~\r\n- ~~Adaptive Tit For Tat~~\r\n- PavlovD: http://www.cs.nott.ac.uk/~pszjl/index_files/chapter4.pdf\r\n- StarSN, StarS, StarN, mem1, PoorD, ltft, MooD, and others  [see here](http://prisoners-dilemma.com/results/cec04/ipd_cec04_full_run.html) [and here](http://www.prisoners-dilemma.com/results/cig05/cig05.html)\r\n- ~~Adaptive~~\r\n- ~~APavlov~~ : http://www.graham-kendall.com/papers/lhk2011.pdf\r\n- ~~NEG: \"NEG plays according to simple rules: if opponent plays COOPERATION, in next move NEG will play DEFECTION; if opponent plays DEFECTION NEG will play COOPERATION. First move will be random.\"~~\r\n- ~~Omega Tit For Tat~~ (see also [here](http://arxiv.org/pdf/cs/0609017.pdf))\r\n\r\nFrom [here](http://www.brembs.net/ipd/rover.html#HD_NM_10):\r\n- Free Rider\r\n- Rover\r\n\r\n[Adaptor](http://www.math.ubc.ca/~hauert/publications/reprints/hauert_jtb02b.pdf)\r\n\r\nFrom [this paper](http://www.graham-kendall.com/papers/lhk2011.pdf) and also [here](http://www.prisoners-dilemma.com/strategies.html):\r\n- ~~adaptive tft~~\r\n- ~~contrite tft~~\r\n- ~~handshake~~ ~~fortress3~~ ~~fortress4~~ ~~firm but fair~~ ~~gradual~~ ~~naive prober~~ ~~remorseful prober~~ ~~reverse pavlov~~ ~~soft grudger~~\r\n\r\nAny of the interesting finite state machine strategies in the papers with fortress (and other papers authored by Wendy Ashlock and Daniel Ashlock, and collaborators)\r\n* E.g. from the 2015 paper \"Multiple Opponent Optimization of\r\nPrisoner’s Dilemma Playing Agents\" including the unnamed sugar strategies and treasure hunt strategies in figures 2 and 3\r\n* ~~Solution B1~~ and ~~Solution B5~~\r\nAlso from \"Fingerprint Analysis of the Noisy Prisoner's Dilemma Using a Finite-State Representation\"\r\n* vengeful, PSY, PSY-TFT, TFT-PSY, UD, UC\r\n\r\nMany from [this paper](http://www.rug.nl/research/institute-evolutionary-life-sciences/tres/_pdf/vdberg_weissing_prsb_2015.pdf). Note the several are already in the library, including ~~ALLC, ALLD, TFT, WSLS, willing, hopeless, and desperate~~ (and possibly others).\r\n\r\nFrom these two papers:\r\n- http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6633638&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6633638\r\n- http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5593371&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5593371\r\n\r\nFrom [this page](http://jasss.soc.surrey.ac.uk/3/4/3.html):\r\n- forgiving\r\n- nasty TFT (randomly plays DD)\r\n\r\nFrom the mythical tournament preliminary to Axelrod #1:\r\n- Analogy\r\n- Look Up / Look Ahead (different from LookerUp in the library)\r\n\r\nFrom [this publication](http://users.softlab.ntua.gr/~brensham/Publications/SAB2000.pdf):\r\n- ~~Gradual~~\r\n- ~~Adaptive tit-for-tat~~\r\n\r\nFrom Axelrod tournament #2:\r\n- Tranquilizer\r\n- Many others if you can convert the [original Fortran code](http://www-personal.umich.edu/%7Eaxe/research/Software/CC/CC2/TourExec1.1.f.html)\r\n- Rule 6, Tit for Tat with Check for Random\r\n- Rule 30, Revised State Transition\r\n- Rule 35, Discoverer\r\n- Rule 27, Tranquilizer\r\n- Rule 55, Adjuster\r\n- Rule 34, Slow-Never\r\n- Rule 16, Fink\r\n\r\nFrom this [paper](http://web.ics.purdue.edu/~yrosokha/docs/Draft8.pdf):\r\n- Lenient Grim 3\r\n- Exp. TFT\r\n- False Cooperator\r\n- TF3T\r\n- Exp Grim 2\r\n- Lenient Grim 2\r\n- Exp TF3T\r\n- T2\r\n\r\nFrom this [paper](http://abricom.org.br/wp-content/uploads/2016/03/bricsccicbic2013_submission_202.pdf):\r\n- shortmem\r\n- selfsteem\r\n- Boxer\r\n- VeryBad\r\n- ANN Agents\r\n- GADP1\r\n- GADP2\r\n- BM\r\n- MC\r\n- Stalker\r\n\r\nFrom this [library](http://www.mathworks.com/matlabcentral/fileexchange/27611-iterated-prisoner-s-dilemma)  (if the license is compatible):\r\n- cautious\r\n- copycat\r\n- craby\r\n- forgetful\r\n- golden\r\n- Hardy\r\n- Mean\r\n- Mensa\r\n- Moron\r\n- Observant\r\n- Unforgiving\r\n- Waffely\r\n- killer\r\n\r\nOthers:\r\n- [Opponent Modeller](http://teaching.csse.uwa.edu.au/year4/Current/Students/Files/2004/DanielDyer/CorrectedDissertation.pdf) [see also](http://ro.ecu.edu.au/cgi/viewcontent.cgi?article=1263&context=ecuworks)\r\n- DBS, DesiredBeliefStrategy [ref](http://www.cs.utexas.edu/~chiu/papers/Au06NoisyIPD.pdf)\r\n- From the 20th anniversary tournament [book](http://www.worldscientific.com/worldscibooks/10.1142/6461) | [slides with some info](https://www.cs.umd.edu/users/nau/game-theory/7%20Repeated%20games.pdf) [Book](http://www.cs.nott.ac.uk/~pszjl/index_files/IPDbook_chap01.pdf)\r\n- [MaRS](http://www.pnas.org/content/110/25/10229.abstract): Mimicry and Relative Similarity\r\n\r\n[No-tricks](http://tplondon.com/journal/index.php/iel/article/viewFile/333/351)\r\nStrategies described [here](http://lesswrong.com/lw/7f2/prisoners_dilemma_tournament_results/)\r\n\r\n\r\nWould be neat to have strategies based on:\r\n- cellular automata / ~~finite state machines~~ [e.g.](http://www.uoguelph.ca/~jbrown16/dominators.pdf)\r\n- bandit algorithms\r\n- the memory-based strategies [described here](http://www.briannakayama.com/Research/UCNCpres.pdf)\r\n- [Markov chain Monte Carlo](https://en.wikipedia.org/wiki/Markov_chain_Monte_Carlo)\r\n- Neural networks [See this paper for examples](http://www.rug.nl/research/institute-evolutionary-life-sciences/tres/_pdf/vdberg_weissing_prsb_2015.pdf)\r\n- \"Particle Swarm Optimization Approaches to Coevolve Strategies for the Iterated Prisoner’s Dilemma\"\r\n- Tree based strategies from \"Crossover and Evolutionary Stability in the Prisoner’s Dilemma\""},"comment":{"url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/comments/277422672","html_url":"https://github.com/Axelrod-Python/Axelrod/issues/379#issuecomment-277422672","issue_url":"https://api.github.com/repos/Axelrod-Python/Axelrod/issues/379","id":277422672,"user":{"login":"janga1997","id":15131207,"avatar_url":"https://avatars.githubusercontent.com/u/15131207?v=3","gravatar_id":"","url":"https://api.github.com/users/janga1997","html_url":"https://github.com/janga1997","followers_url":"https://api.github.com/users/janga1997/followers","following_url":"https://api.github.com/users/janga1997/following{/other_user}","gists_url":"https://api.github.com/users/janga1997/gists{/gist_id}","starred_url":"https://api.github.com/users/janga1997/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/janga1997/subscriptions","organizations_url":"https://api.github.com/users/janga1997/orgs","repos_url":"https://api.github.com/users/janga1997/repos","events_url":"https://api.github.com/users/janga1997/events{/privacy}","received_events_url":"https://api.github.com/users/janga1997/received_events","type":"User","site_admin":false},"created_at":"2017-02-04T06:20:24Z","updated_at":"2017-02-04T06:20:24Z","body":"@drvinceknight Apart from type-hinting, I think I would like to work on a strategy. \r\nAre these taken or already done?\r\n\r\n> cautious\r\ncopycat\r\ncraby\r\nforgetful\r\ngolden"}}
{"actor":{"display_login":"janga1997"}}