<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>thesis</genre>

<titleInfo><title>Forgiver triumphs in alternating prisoner&apos;s dilemma </title></titleInfo>





<name type="personal">
  <namePart type="given">Benjamin</namePart>
  <namePart type="family">Zagorsky</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Johannes</namePart>
  <namePart type="family">Reiter</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">4A918E98-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-0170-7353</description></name>
<name type="personal">
  <namePart type="given">Krishnendu</namePart>
  <namePart type="family">Chatterjee</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2E5DCA20-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-4561-241X</description></name>
<name type="personal">
  <namePart type="given">Martin</namePart>
  <namePart type="family">Nowak</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">KrCh</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">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&apos;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.</abstract>

<originInfo><publisher>Public Library of Science</publisher><dateIssued encoding="w3cdtf">2013</dateIssued>
</originInfo>



<relatedItem type="host"><identifier type="doi">10.1371/journal.pone.0080814.s001</identifier>
<part>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/2247</url>  </location>
</relatedItem>

<extension>
<bibliographicCitation>
<ama>Zagorsky B, Reiter J, Chatterjee K, Nowak M. Forgiver triumphs in alternating prisoner’s dilemma . 2013. doi:&lt;a href=&quot;https://doi.org/10.1371/journal.pone.0080814.s001&quot;&gt;10.1371/journal.pone.0080814.s001&lt;/a&gt;</ama>
<ista>Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma , Public Library of Science, &lt;a href=&quot;https://doi.org/10.1371/journal.pone.0080814.s001&quot;&gt;10.1371/journal.pone.0080814.s001&lt;/a&gt;.</ista>
<ieee>B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma .” Public Library of Science, 2013.</ieee>
<short>B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, (2013).</short>
<mla>Zagorsky, Benjamin, et al. &lt;i&gt;Forgiver Triumphs in Alternating Prisoner’s Dilemma &lt;/i&gt;. Public Library of Science, 2013, doi:&lt;a href=&quot;https://doi.org/10.1371/journal.pone.0080814.s001&quot;&gt;10.1371/journal.pone.0080814.s001&lt;/a&gt;.</mla>
<apa>Zagorsky, B., Reiter, J., Chatterjee, K., &amp;#38; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science. &lt;a href=&quot;https://doi.org/10.1371/journal.pone.0080814.s001&quot;&gt;https://doi.org/10.1371/journal.pone.0080814.s001&lt;/a&gt;</apa>
<chicago>Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .” Public Library of Science, 2013. &lt;a href=&quot;https://doi.org/10.1371/journal.pone.0080814.s001&quot;&gt;https://doi.org/10.1371/journal.pone.0080814.s001&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>9749</recordIdentifier><recordCreationDate encoding="w3cdtf">2021-07-28T15:45:07Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-09-29T14:30:03Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
