<mets:mets OBJID="eprint_4316" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T22:32:32Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_4316_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>Invasion dynamics of the finitely repeated Prisoner's Dilemma game</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">K.</mods:namePart><mods:namePart type="family">Sigmund</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">M.A.</mods:namePart><mods:namePart type="family">Nowak</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>Computer simulations have shown that mutation-selection processes frequently lead to the establishment of cooperation in the repeated prisoner's dilemma. To simplify the mathematical analysis, it has usually been assumed that the interaction is repeated infinitely often. Here, we consider the finitely repeated case. Using renewal equations, we derive analytic results on the adaptive dynamics of monomorphic populations evolving in trait-space, describe the cooperation-rewarding zone and specify when unconditional defectors can invade. Tit for tat plays an essential, but transient, role in the evolution of cooperation. A large part of the paper considers the case when players make their moves not simultaneously, but alternatingly.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1995-11</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Elsevier</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_4316"><mets:rightsMD ID="rights_eprint_4316_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_4316_mods" ADMID="TMD_eprint_4316"></mets:div></mets:structMap></mets:mets>