<?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-03807547</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-17T06:40:16+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Games Where You Can Play Optimally with Arena-Independent Finite Memory</title>
            <author role="aut">
              <persName>
                <forename type="first">Patricia</forename>
                <surname>Bouyer</surname>
              </persName>
              <email type="md5">2bb86de7cbe5ca3964ad6bc068ff02f1</email>
              <email type="domain">lmf.cnrs.fr</email>
              <idno type="idhal" notation="string">patricia-bouyer</idno>
              <idno type="idhal" notation="numeric">174420</idno>
              <idno type="halauthorid" notation="string">6092-174420</idno>
              <idno type="ARXIV">https://arxiv.org/a/bouyer_p_2</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2823-0911</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=sgKO-H4AAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/176675426</idno>
              <affiliation ref="#struct-1065710"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stéphane Le</forename>
                <surname>Roux</surname>
              </persName>
              <idno type="halauthorid">2012188-0</idno>
              <affiliation ref="#struct-1065710"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Youssouf</forename>
                <surname>Oualhadj</surname>
              </persName>
              <email type="md5">124dec7eabaaa29082a0a0de32c7149c</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1381472</idno>
              <idno type="halauthorid" notation="string">419850-1381472</idno>
              <affiliation ref="#struct-182989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mickael</forename>
                <surname>Randour</surname>
              </persName>
              <idno type="halauthorid">1204270-0</idno>
              <affiliation ref="#struct-160918"/>
              <affiliation ref="#struct-444194"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Vandenhove</surname>
              </persName>
              <idno type="halauthorid">50781-0</idno>
              <affiliation ref="#struct-160918"/>
              <affiliation ref="#struct-444194"/>
              <affiliation ref="#struct-1065710"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Patricia</forename>
                <surname>Bouyer</surname>
              </persName>
              <email type="md5">2bb86de7cbe5ca3964ad6bc068ff02f1</email>
              <email type="domain">lmf.cnrs.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-10-10 06:14:40</date>
              <date type="whenModified">2025-09-01 11:40:02</date>
              <date type="whenReleased">2022-10-10 06:14:40</date>
              <date type="whenProduced">2022-01-17</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2001.03894"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="728069">
                <persName>
                  <forename>Patricia</forename>
                  <surname>Bouyer</surname>
                </persName>
                <email type="md5">2bb86de7cbe5ca3964ad6bc068ff02f1</email>
                <email type="domain">lmf.cnrs.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03807547</idno>
            <idno type="halUri">https://centralesupelec.hal.science/hal-03807547</idno>
            <idno type="halBibtex">bouyer:hal-03807547</idno>
            <idno type="halRefHtml">&lt;i&gt;Logical Methods in Computer Science&lt;/i&gt;, 2022, Volume 18, Issue 1, &lt;a target="_blank" href="https://dx.doi.org/10.46298/lmcs-18(1:11)2022"&gt;&amp;#x27E8;10.46298/lmcs-18(1:11)2022&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Logical Methods in Computer Science, 2022, Volume 18, Issue 1, &amp;#x27E8;10.46298/lmcs-18(1:11)2022&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="LACL" corresp="UPEC">Laboratoire d'Algorithmique Complexité et Logique</idno>
            <idno type="stamp" n="UPEC" corresp="CV_UPEC">Université Paris-Est Créteil Val-de-Marne</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="ENS-PSACLAY">Ecole Normale Supérieure Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LMF">Laboratoire Méthodes Formelles</idno>
            <idno type="stamp" n="LMF-MCS">Model-checking et synthèse</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Games Where You Can Play Optimally with Arena-Independent Finite Memory</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Patricia</forename>
                    <surname>Bouyer</surname>
                  </persName>
                  <email type="md5">2bb86de7cbe5ca3964ad6bc068ff02f1</email>
                  <email type="domain">lmf.cnrs.fr</email>
                  <idno type="idhal" notation="string">patricia-bouyer</idno>
                  <idno type="idhal" notation="numeric">174420</idno>
                  <idno type="halauthorid" notation="string">6092-174420</idno>
                  <idno type="ARXIV">https://arxiv.org/a/bouyer_p_2</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2823-0911</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=sgKO-H4AAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/176675426</idno>
                  <affiliation ref="#struct-1065710"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stéphane Le</forename>
                    <surname>Roux</surname>
                  </persName>
                  <idno type="halauthorid">2012188-0</idno>
                  <affiliation ref="#struct-1065710"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Youssouf</forename>
                    <surname>Oualhadj</surname>
                  </persName>
                  <email type="md5">124dec7eabaaa29082a0a0de32c7149c</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1381472</idno>
                  <idno type="halauthorid" notation="string">419850-1381472</idno>
                  <affiliation ref="#struct-182989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mickael</forename>
                    <surname>Randour</surname>
                  </persName>
                  <idno type="halauthorid">1204270-0</idno>
                  <affiliation ref="#struct-160918"/>
                  <affiliation ref="#struct-444194"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Vandenhove</surname>
                  </persName>
                  <idno type="halauthorid">50781-0</idno>
                  <affiliation ref="#struct-160918"/>
                  <affiliation ref="#struct-444194"/>
                  <affiliation ref="#struct-1065710"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">1692</idno>
                <idno type="eissn">1860-5974</idno>
                <title level="j">Logical Methods in Computer Science</title>
                <imprint>
                  <publisher>Logical Methods in Computer Science Association</publisher>
                  <biblScope unit="volume">Volume 18, Issue 1</biblScope>
                  <date type="datePub">2022-01-17</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2001.03894</idno>
              <idno type="doi">10.46298/lmcs-18(1:11)2022</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-gt">Computer Science [cs]/Computer Science and Game Theory [cs.GT]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as the quest for a winning strategy of the system in a game against its antagonistic environment. Depending on the specification, optimal strategies might be simple or quite complex, for example having to use (possibly infinite) memory. Hence, research strives to understand which settings allow for simple strategies. In 2005, Gimbert and Zielonka provided a complete characterization of preference relations (a formal framework to model specifications and game objectives) that admit memoryless optimal strategies for both players. In the last fifteen years however, practical applications have driven the community toward games with complex or multiple objectives, where memory -- finite or infinite -- is almost always required. Despite much effort, the exact frontiers of the class of preference relations that admit finite-memory optimal strategies still elude us. In this work, we establish a complete characterization of preference relations that admit optimal strategies using arena-independent finite memory, generalizing the work of Gimbert and Zielonka to the finite-memory case. We also prove an equivalent to their celebrated corollary of great practical interest: if both players have optimal (arena-independent-)finite-memory strategies in all one-player games, then it is also the case in all two-player games. Finally, we pinpoint the boundaries of our results with regard to the literature: our work completely covers the case of arena-independent memory (e.g., multiple parity objectives, lower- and upper-bounded energy objectives), and paves the way to the arena-dependent case (e.g., multiple lower-bounded energy objectives).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1065710" status="VALID">
          <idno type="IdRef">25474589X</idno>
          <idno type="RNSR">202123712M</idno>
          <idno type="ROR">https://ror.org/00gdtta79</idno>
          <idno type="Wikidata">Q109042513</idno>
          <orgName>Laboratoire Méthodes Formelles</orgName>
          <orgName type="acronym">LMF</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>4, avenue des Sciences, 91190, Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9021" active="#struct-441569" type="direct"/>
            <relation active="#struct-523723" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-182989" status="VALID">
          <idno type="IdRef">113845588</idno>
          <idno type="RNSR">200715457A</idno>
          <orgName>Laboratoire d'Algorithmique Complexité et Logique</orgName>
          <orgName type="acronym">LACL</orgName>
          <desc>
            <address>
              <addrLine>LACL, Université Paris-Est Créteil Val-de-Marne, 61 avenue du Général de Gaulle 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lacl.fr</ref>
          </desc>
          <listRelation>
            <relation name="EA4219" active="#struct-420786" type="direct"/>
          </listRelation>
        </org>
        <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="institution" xml:id="struct-444194" status="VALID">
          <idno type="ISNI">0000 0004 0647 2148</idno>
          <idno type="ROR">https://ror.org/03q83t159</idno>
          <idno type="Wikidata">Q2600910</idno>
          <orgName>Fonds National de la Recherche Scientifique = Fund for Scientific Research [Bruxelles]</orgName>
          <orgName type="acronym">FRS-FNRS</orgName>
          <date type="start">1928-01-01</date>
          <desc>
            <address>
              <addrLine>5, rue d'Egmont, BE-1000 Bruxelles</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">https://www.frs-fnrs.be/fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/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>
        <org type="institution" xml:id="struct-523723" status="VALID">
          <idno type="ROR">https://ror.org/00hx6zz33</idno>
          <orgName>Ecole Normale Supérieure  Paris-Saclay</orgName>
          <orgName type="acronym">ENS Paris Saclay</orgName>
          <desc>
            <address>
              <addrLine>4 avenue des Sciences, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://ens-paris-saclay.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-420786" status="VALID">
          <idno type="IdRef">028021037</idno>
          <idno type="ISNI">0000000121497878</idno>
          <idno type="ROR">https://ror.org/05ggc9x40</idno>
          <orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName>
          <orgName type="acronym">UPEC UP12</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-pec.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>