<?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-05579100</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-04-30T16:07:53+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Breaking exponential complexity in games of ordered preference: A tractable reformulation</title>
            <author role="aut">
              <persName>
                <forename type="first">Dong Ho</forename>
                <surname>Lee</surname>
              </persName>
              <idno type="halauthorid">3069214-0</idno>
              <affiliation ref="#struct-74980"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jingqi</forename>
                <surname>Li</surname>
              </persName>
              <idno type="halauthorid">4091089-0</idno>
              <affiliation ref="#struct-74980"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Lasse</forename>
                <surname>Peters</surname>
              </persName>
              <idno type="halauthorid">221460-0</idno>
              <affiliation ref="#struct-563719"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Georgios</forename>
                <surname>Bakirtzis</surname>
              </persName>
              <email type="md5">d5bad8ff1c66bb15f845fc4516c3663f</email>
              <email type="domain">telecom-paris.fr</email>
              <idno type="idhal" notation="string">georgios-bakirtzis</idno>
              <idno type="idhal" notation="numeric">1547670</idno>
              <idno type="halauthorid" notation="string">3556793-1547670</idno>
              <idno type="ARXIV">https://arxiv.org/a/bakirtzis_g_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4992-0193</idno>
              <affiliation ref="#struct-554439"/>
              <affiliation ref="#struct-121818"/>
              <affiliation ref="#struct-563936"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">David</forename>
                <surname>Fridovich-Keil</surname>
              </persName>
              <idno type="halauthorid">2264264-0</idno>
              <affiliation ref="#struct-74980"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Georgios</forename>
                <surname>Bakirtzis</surname>
              </persName>
              <email type="md5">d5bad8ff1c66bb15f845fc4516c3663f</email>
              <email type="domain">telecom-paris.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2026-04-03 12:11:44</date>
              <date type="whenModified">2026-04-18 20:23:47</date>
              <date type="whenReleased">2026-04-09 15:19:00</date>
              <date type="whenProduced">2026-04-03</date>
              <date type="whenEndEmbargoed">2026-04-03</date>
              <ref type="file" target="https://hal.science/hal-05579100v1/document">
                <date notBefore="2026-04-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-05579100v1/file/2603.26950v1.pdf" id="file-5579100-4778637">
                <date notBefore="2026-04-03"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2603.26950"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1682010">
                <persName>
                  <forename>Georgios</forename>
                  <surname>Bakirtzis</surname>
                </persName>
                <email type="md5">d5bad8ff1c66bb15f845fc4516c3663f</email>
                <email type="domain">telecom-paris.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-05579100</idno>
            <idno type="halUri">https://hal.science/hal-05579100</idno>
            <idno type="halBibtex">lee:hal-05579100</idno>
            <idno type="halRefHtml">2026</idno>
            <idno type="halRef">2026</idno>
            <availability status="restricted">
              <licence target="https://www.etalab.gouv.fr/wp-content/uploads/2017/04/ETALAB-Licence-Ouverte-v2.0.pdf">ETALAB - Open licence<ref corresp="#file-5579100-4778637"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENST">Ecole Nationale Supérieure des Télécommunications</idno>
            <idno type="stamp" n="TELECOM-PARISTECH" corresp="PARISTECH">Télécom Paris</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="LTCI" corresp="TELECOM-PARISTECH">Laboratoire Traitement et Communication de l'Information</idno>
            <idno type="stamp" n="INFRES" corresp="TELECOM-PARISTECH">Département Informatique et Réseaux</idno>
            <idno type="stamp" n="ACES" corresp="TELECOM-PARISTECH">Equipe Autonomic and Critical Embedded Systems</idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</idno>
            <idno type="stamp" n="IP-PARIS-DEPARTEMENT-MATHEMATIQUES">Département de Mathèmatiques</idno>
            <idno type="stamp" n="IP-PARIS-MATHEMATIQUES">IP Paris Département de Mathématiques</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATION-COMMUNICATION-ELECTRONIQUE">IP Paris Département d'Information, de Communication et d'Électronique</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATIQUE-DONNEES-ET-IA">IP Paris Département d'Informatique, de Données et d'IA</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Breaking exponential complexity in games of ordered preference: A tractable reformulation</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Dong Ho</forename>
                    <surname>Lee</surname>
                  </persName>
                  <idno type="halauthorid">3069214-0</idno>
                  <affiliation ref="#struct-74980"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jingqi</forename>
                    <surname>Li</surname>
                  </persName>
                  <idno type="halauthorid">4091089-0</idno>
                  <affiliation ref="#struct-74980"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Lasse</forename>
                    <surname>Peters</surname>
                  </persName>
                  <idno type="halauthorid">221460-0</idno>
                  <affiliation ref="#struct-563719"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Georgios</forename>
                    <surname>Bakirtzis</surname>
                  </persName>
                  <email type="md5">d5bad8ff1c66bb15f845fc4516c3663f</email>
                  <email type="domain">telecom-paris.fr</email>
                  <idno type="idhal" notation="string">georgios-bakirtzis</idno>
                  <idno type="idhal" notation="numeric">1547670</idno>
                  <idno type="halauthorid" notation="string">3556793-1547670</idno>
                  <idno type="ARXIV">https://arxiv.org/a/bakirtzis_g_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4992-0193</idno>
                  <affiliation ref="#struct-554439"/>
                  <affiliation ref="#struct-121818"/>
                  <affiliation ref="#struct-563936"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">David</forename>
                    <surname>Fridovich-Keil</surname>
                  </persName>
                  <idno type="halauthorid">2264264-0</idno>
                  <affiliation ref="#struct-74980"/>
                </author>
              </analytic>
              <monogr>
                <imprint>
                  <date type="datePub">2026</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2603.26950</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-gt">Computer Science [cs]/Computer Science and Game Theory [cs.GT]</classCode>
              <classCode scheme="halDomain" n="info.info-sy">Computer Science [cs]/Systems and Control [cs.SY]</classCode>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Games of ordered preference (GOOPs) model multi-player equilibrium problems in which each player maintains a distinct hierarchy of strictly prioritized objectives. Existing approaches solve GOOPs by deriving and enforcing the necessary optimality conditions that characterize lexicographically constrained Nash equilibria through a single-level reformulation. However, the number of primal and dual variables in the resulting KKT system grows exponentially with the number of preference levels, leading to severe scalability challenges. We derive a compact reformulation of these necessary conditions that preserves the essential primal stationarity structure across hierarchy levels, yielding a "reduced" KKT system whose size grows polynomially with both the number of players and the number of preference levels. The reduced system constitutes a relaxation of the complete KKT system, yet it remains a valid necessary condition for local GOOP equilibria. For GOOPs with quadratic objectives and linear constraints, we prove that the primal solution sets of the reduced and complete KKT systems coincide. More generally, for GOOPs with arbitrary (but smooth) nonlinear objectives and constraints, the reduced KKT conditions recover all local GOOP equilibria but may admit spurious non-equilibrium solutions. We introduce a second-order sufficient condition to certify when a candidate point corresponds to a local GOOP equilibrium. We also develop a primal-dual interior-point method for computing a local GOOP equilibrium with local quadratic convergence. The resulting framework enables scalable and efficient computation of GOOP equilibria beyond the tractable range of existing exponentially complex formulations.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-74980" status="VALID">
          <idno type="ROR">https://ror.org/00hj54h04</idno>
          <orgName>University of Texas at Austin [Austin]</orgName>
          <desc>
            <address>
              <addrLine>1 University Station Austin, Texas 78712</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.utexas.edu/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-563719" status="VALID">
          <idno type="ROR">https://ror.org/01an7q238</idno>
          <orgName>University of California [Berkeley]</orgName>
          <orgName type="acronym">UC Berkeley</orgName>
          <desc>
            <address>
              <addrLine>Berkeley, CA</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.berkeley.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-471291" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-554439" status="VALID">
          <orgName>Autonomic and Critical Embedded Systems</orgName>
          <orgName type="acronym">ACES</orgName>
          <date type="start">2019-02-22</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://ltci.telecom-paristech.fr/research-team/aces/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-484335" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
            <relation active="#struct-1048346" type="indirect"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-121818" status="VALID">
          <orgName>Département Informatique et Réseaux</orgName>
          <orgName type="acronym">INFRES</orgName>
          <desc>
            <address>
              <addrLine>46, rue Barrault 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci/les-departements-denseignement-et-recherche</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300362" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-471291" status="VALID">
          <idno type="ROR">https://ror.org/00pjdza24</idno>
          <orgName>University of California</orgName>
          <orgName type="acronym">UC</orgName>
          <date type="start">1869-01-01</date>
          <desc>
            <address>
              <country key="US"/>
            </address>
            <ref type="url">https://www.universityofcalifornia.edu/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-484335" status="VALID">
          <idno type="IdRef">162384270</idno>
          <idno type="ISNI">0000 0000 9194 9502</idno>
          <idno type="RNSR">200319327Z</idno>
          <idno type="ROR">https://ror.org/057er4c39</idno>
          <orgName>Laboratoire Traitement et Communication de l'Information</orgName>
          <orgName type="acronym">LTCI</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-1048346" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1048346" status="VALID">
          <idno type="IdRef">026375273</idno>
          <idno type="ISNI">0000 0001 2108 2779</idno>
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom Paris</orgName>
          <date type="start">2019-06-12</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300362" status="VALID">
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom ParisTech</orgName>
          <date type="start">2008-01-01</date>
          <date type="end">2019-06-11</date>
          <desc>
            <address>
              <addrLine>46 rue Barrault 75634 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>