{"oa":1,"language":[{"iso":"eng"}],"day":"12","volume":8,"year":"2013","publisher":"Public Library of Science","pubrep_id":"409","publication_status":"published","file":[{"date_created":"2018-12-12T10:11:15Z","content_type":"application/pdf","file_size":1050042,"checksum":"808e8b9e6e89658bee4ffbbfac1bd19d","date_updated":"2020-07-14T12:45:34Z","creator":"system","access_level":"open_access","file_name":"IST-2016-409-v1+1_journal.pone.0080814.pdf","file_id":"4868","relation":"main_file"}],"publist_id":"4702","doi":"10.1371/journal.pone.0080814","issue":"12","publication":"PLoS One","_id":"2247","article_number":"e80814","date_updated":"2023-09-07T11:40:43Z","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2013-12-12T00:00:00Z","file_date_updated":"2020-07-14T12:45:34Z","oa_version":"Published Version","date_created":"2018-12-11T11:56:33Z","month":"12","type":"journal_article","ddc":["000"],"title":"Forgiver triumphs in alternating prisoner's dilemma ","ec_funded":1,"status":"public","department":[{"_id":"KrCh"}],"citation":{"ieee":"B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” <i>PLoS One</i>, vol. 8, no. 12. Public Library of Science, 2013.","apa":"Zagorsky, B., Reiter, J., Chatterjee, K., &#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>","mla":"Zagorsky, Benjamin, et al. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>, vol. 8, no. 12, e80814, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>.","chicago":"Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” <i>PLoS One</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pone.0080814\">https://doi.org/10.1371/journal.pone.0080814</a>.","short":"B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).","ama":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . <i>PLoS One</i>. 2013;8(12). doi:<a href=\"https://doi.org/10.1371/journal.pone.0080814\">10.1371/journal.pone.0080814</a>","ista":"Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12), e80814."},"intvolume":"         8","author":[{"full_name":"Zagorsky, Benjamin","last_name":"Zagorsky","first_name":"Benjamin"},{"last_name":"Reiter","full_name":"Reiter, Johannes","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353","first_name":"Johannes"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"abstract":[{"text":"Cooperative behavior, where one individual incurs a cost to help another, is a wide spread phenomenon. Here we study direct reciprocity in the context of the alternating Prisoner's Dilemma. We consider all strategies that can be implemented by one and two-state automata. We calculate the payoff matrix of all pairwise encounters in the presence of noise. We explore deterministic selection dynamics with and without mutation. Using different error rates and payoff values, we observe convergence to a small number of distinct equilibria. Two of them are uncooperative strict Nash equilibria representing always-defect (ALLD) and Grim. The third equilibrium is mixed and represents a cooperative alliance of several strategies, dominated by a strategy which we call Forgiver. Forgiver cooperates whenever the opponent has cooperated; it defects once when the opponent has defected, but subsequently Forgiver attempts to re-establish cooperation even if the opponent has defected again. Forgiver is not an evolutionarily stable strategy, but the alliance, which it rules, is asymptotically stable. For a wide range of parameter values the most commonly observed outcome is convergence to the mixed equilibrium, dominated by Forgiver. Our results show that although forgiving might incur a short-term loss it can lead to a long-term gain. Forgiveness facilitates stable cooperation in the presence of exploitation and noise.","lang":"eng"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9749"},{"id":"1400","status":"public","relation":"dissertation_contains"}]},"quality_controlled":"1","scopus_import":1}