<mets:mets OBJID="eprint_32099" 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:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mets="http://www.loc.gov/METS/"><mets:metsHdr CREATEDATE="2026-06-09T16:29:19Z"><mets:agent TYPE="ORGANIZATION" ROLE="CUSTODIAN"><mets:name>Munich Personal RePEc Archive</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_32099_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>An Algorithm for payoff space in C1 parametric games</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">David</mods:namePart><mods:namePart type="family">Carfì</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Angela</mods:namePart><mods:namePart type="family">Ricciardello</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Santa</mods:namePart><mods:namePart type="family">Agreste</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>We present a novel algorithm to determine the payoff-space of certain normal-form C1 parametric games, and - more generally - of continuous families of normal-form C1 games. The algorithm has been implemented by using MATLAB, and it has been applied to several examples. The implementation of the algorithm gives the parametric expressions of the critical zone of any game in the family under consideration both in the bistrategy space and in the payoff space and the graphical representations of the disjoint union (with respect to the parameter set of the parametric game) of the family of all payoff spaces. We have so the parametric representation of the union of all the critical zones. One of the main motivations of our paper is that, in the applications, many normal-form games appear naturally in a parametric fashion; moreover, some efficient models of coopetition are parametric games of the considered type. Specifically, we have realized an algorithm that provides the parametric and graphical representation of the payoff space and of the critical zone of a parametric game in normal-form, supported by a finite family of compact intervals of the real line. Our final goal is to provide a valuable tool to study simply (but completely) normal-form C1-parametric games in two dimensions.</mods:abstract><mods:classification authority="lcc">C71 - Cooperative Games</mods:classification><mods:classification authority="lcc">C7 - Game Theory and Bargaining Theory</mods:classification><mods:classification authority="lcc">C72 - Noncooperative Games</mods:classification><mods:classification authority="lcc">C73 - Stochastic and Dynamic Games ; Evolutionary Games ; Repeated Games</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8601">2011</mods:dateIssued></mods:originInfo><mods:genre>MPRA Paper</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_32099"><mets:rightsMD ID="rights_eprint_32099_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<div style="background-color: #e5e5eb; padding: 5px; font-weight: bold; margin-top: 5px;" xmlns="http://www.w3.org/1999/xhtml">
<h2>Copyright Agreement</h2>
<p>1. The author hereby affirms that he or she accepts the editorial guidelines given at <a href="https://mpra.ub.uni-muenchen.de/information.html">https://mpra.ub.uni-muenchen.de/information.html</a>.</p>
<p>2. The author hereby grants to the University Library of the Ludwig-Maximilians-Universität (LMU) a non-exclusive licence to make the electronic version of the uploaded work publicly accessible through the "Munich Personal RePEc Archive" (MPRA) repository. This licence includes abstracts and metadata and is valid for the duration of the statutory protection period, without territorial limitation. The licence furthermore includes the right to replicate the work as required, especially for the purposes of including the work and/or abstracts and metadata in electronic databases and of employing digital or other transmission technology to make this data available to large numbers of users, using either services invoked by user request or services initiated by the repository, and encompassing all forms of transmission (cable, wireless, satellite etc.) and protocol (TCP/IP, http, ftp etc.).</p>
<p>3. This contract entitles the University Library to transfer the licence granted herein either partially or wholly to a third party and to grant non-exclusive rights to other repositories without requiring the authors explicit permission.</p>
<p>4. The author hereby affirms that no third-party rights are infringed by the electronic publication of the work and undertakes to indemnify the University Library of the LMU against any third-party claims relating to the infringement of copyright legislation or exclusive usage rights which may result from the publication of the work through the University Library repository. The author hereby undertakes to reimburse any charges resulting from a rights infringement caused by him or her.</p>
<p>5. In the event that the author is not the sole author of the work in question, he/she hereby declares that he/she has been empowered by his/her co-authors to grant the above-mentioned usage licence.</p>
<p>6. In the event that the person who is uploading the work in question is not the author of this work, he/she hereby declares that he/she has been empowered by the author(s) to grant the above-mentioned usage licence.</p>
<p>7. The author continues to retain the usage rights to his or her work and may also bestow these rights elsewhere provided this does not curtail the rights granted to the University Library of the LMU in this declaration.</p>
</div>
<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button below indicates your agreement to these terms.</p>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>As the submission cannot be modified once it is accepted, please submit only if you are absolutely sure that no further changes are needed.</strong> Otherwise select the "Save for Later" button and review your submission. By doing so, nothing you have entered will be lost and you can resume your submission any time in the future.</p>
</mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec><mets:fileGrp USE="reference"><mets:file OWNERID="https://mpra.ub.uni-muenchen.de/32099/1/MPRA_paper_32099.pdf" ID="eprint_32099_37720_1" SIZE="2408956" MIMETYPE="application/pdf"><mets:FLocat xlink:type="simple" xlink:href="https://mpra.ub.uni-muenchen.de/32099/1/MPRA_paper_32099.pdf" LOCTYPE="URL"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div ADMID="TMD_eprint_32099" DMDID="DMD_eprint_32099_mods"><mets:fptr FILEID="eprint_32099_document_37720_1"></mets:fptr></mets:div></mets:structMap></mets:mets>