<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-04939923</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-03T12:06:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Permissive Equilibria in Multiplayer Reachability Games</title>
            <author role="aut">
              <persName>
                <forename type="first">Aline</forename>
                <surname>Goeminne</surname>
              </persName>
              <idno type="halauthorid">2583515-0</idno>
              <affiliation ref="#struct-160918"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Benjamin</forename>
                <surname>Monmege</surname>
              </persName>
              <email type="md5">ee6017b90089218aaa709dc2eca3abf8</email>
              <email type="domain">univ-amu.fr</email>
              <idno type="idhal" notation="string">benjamin-monmege</idno>
              <idno type="idhal" notation="numeric">5434</idno>
              <idno type="halauthorid" notation="string">16949-5434</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4717-9955</idno>
              <idno type="IDREF">https://www.idref.fr/176828885</idno>
              <affiliation ref="#struct-530003"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Benjamin</forename>
                <surname>Monmege</surname>
              </persName>
              <email type="md5">ee6017b90089218aaa709dc2eca3abf8</email>
              <email type="domain">univ-amu.fr</email>
            </editor>
            <funder ref="#projanr-102903"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-02-11 10:37:05</date>
              <date type="whenModified">2026-04-22 09:38:06</date>
              <date type="whenReleased">2025-02-17 16:27:48</date>
              <date type="whenProduced">2025</date>
              <date type="whenEndEmbargoed">2025-02-11</date>
              <ref type="file" target="https://amu.hal.science/hal-04939923v1/document">
                <date notBefore="2025-02-11"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://amu.hal.science/hal-04939923v1/file/GoeMon25.pdf" id="file-4939923-4295100">
                <date notBefore="2025-02-11"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="162699">
                <persName>
                  <forename>Benjamin</forename>
                  <surname>Monmege</surname>
                </persName>
                <email type="md5">ee6017b90089218aaa709dc2eca3abf8</email>
                <email type="domain">univ-amu.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04939923</idno>
            <idno type="halUri">https://amu.hal.science/hal-04939923</idno>
            <idno type="halBibtex">goeminne:hal-04939923</idno>
            <idno type="halRefHtml">&lt;i&gt;33rd EACSL Annual conference on Computer Science Logic (CSL 2025)&lt;/i&gt;, 2025, Amsterdam, France. &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.CSL.2025.23"&gt;&amp;#x27E8;10.4230/LIPIcs.CSL.2025.23&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">33rd EACSL Annual conference on Computer Science Logic (CSL 2025), 2025, Amsterdam, France. &amp;#x27E8;10.4230/LIPIcs.CSL.2025.23&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4939923-4295100"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="MOVE" corresp="LIS-LAB">MOVE Modélisation et Vérification - LIS Laboratoire d'Informatique et Systèmes de Marseille (UMR 7020)</idno>
            <idno type="stamp" n="ANR">ANR</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Permissive Equilibria in Multiplayer Reachability Games</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Aline</forename>
                    <surname>Goeminne</surname>
                  </persName>
                  <idno type="halauthorid">2583515-0</idno>
                  <affiliation ref="#struct-160918"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Benjamin</forename>
                    <surname>Monmege</surname>
                  </persName>
                  <email type="md5">ee6017b90089218aaa709dc2eca3abf8</email>
                  <email type="domain">univ-amu.fr</email>
                  <idno type="idhal" notation="string">benjamin-monmege</idno>
                  <idno type="idhal" notation="numeric">5434</idno>
                  <idno type="halauthorid" notation="string">16949-5434</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4717-9955</idno>
                  <idno type="IDREF">https://www.idref.fr/176828885</idno>
                  <affiliation ref="#struct-530003"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proceedings of the 33rd EACSL Annual conference on Computer Science Logic (CSL 2025)</title>
                <meeting>
                  <title>33rd EACSL Annual conference on Computer Science Logic (CSL 2025)</title>
                  <date type="start">2025</date>
                  <settlement>Amsterdam</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher>
                  <biblScope unit="volume">326</biblScope>
                  <biblScope unit="issue">23</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.4230/LIPIcs.CSL.2025.23</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-cl">Computer Science [cs]/Computation and Language [cs.CL]</classCode>
              <classCode scheme="halDomain" n="info.info-gt">Computer Science [cs]/Computer Science and Game Theory [cs.GT]</classCode>
              <classCode scheme="halDomain" n="info.info-fl">Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We study multi-strategies in multiplayer reachability games played on finite graphs. A multi-strategy prescribes a set of possible actions, instead of a single action as usual strategies: it represents a set of all strategies that are consistent with it. We aim for profiles of multi-strategies (a multi-strategy per player), where each profile of consistent strategies is a Nash equilibrium, or a subgame perfect equilibrium. The permissiveness of two multi-strategies can be compared with penalties, as already used in the two-player zero-sum setting by Bouyer, Duflot, Markey and Renault [3]. We show that we can decide the existence of a multi-strategy profile that is a Nash equilibrium or a subgame perfect equilibrium, while satisfying some upper-bound constraints on the penalties in PSPACE, if the upper-bound penalties are given in unary. The same holds when we search for multi-strategies where certain players are asked to win in at least one play or in all plays.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-160918" status="VALID">
          <idno type="IdRef">190187433</idno>
          <idno type="ROR">https://ror.org/02qnnz951</idno>
          <orgName>Université de Mons = University of Mons</orgName>
          <orgName type="acronym">UMONS</orgName>
          <date type="start">2009-01-01</date>
          <desc>
            <address>
              <addrLine>20, place du Parc, B7000 Mons</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">http://portail.umons.ac.be/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-530003" status="VALID">
          <orgName>Modélisation et Vérification</orgName>
          <orgName type="acronym">MOVE</orgName>
          <desc>
            <address>
              <addrLine>Luminy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr/recherche/calcul/move</ref>
          </desc>
          <listRelation>
            <relation active="#struct-527033" type="direct"/>
            <relation name="UMR7020" active="#struct-198056" type="indirect"/>
            <relation name="UMR7020" active="#struct-303091" type="indirect"/>
            <relation name="UMR7020" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-102903" status="VALID">
          <idno type="anr">ANR-23-CE48-0008</idno>
          <orgName>QuaSy</orgName>
          <desc>Synthèse Quantitative</desc>
          <date type="start">2023</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>