<?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-01461689</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-26T00:25:03+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Penalized Best-Response Algorithm for Non-Linear Single-Path Routing Problems</title>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Brun</surname>
              </persName>
              <email type="md5">0a40d74b31fe666d8c75b1eada4c36eb</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">olivier-brun</idno>
              <idno type="idhal" notation="numeric">13446</idno>
              <idno type="halauthorid" notation="string">23862-13446</idno>
              <idno type="IDREF">https://www.idref.fr/156351994</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4685-5306</idno>
              <orgName ref="#struct-388967"/>
              <affiliation ref="#struct-388967"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Balakrishna</forename>
                <surname>Prabhu</surname>
              </persName>
              <email type="md5">3ab0c132f59649dd3f560e1b3e9ddc9b</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">balakrishnaprabhu</idno>
              <idno type="idhal" notation="numeric">13979</idno>
              <idno type="halauthorid" notation="string">29457-13979</idno>
              <idno type="IDREF">https://www.idref.fr/092720447</idno>
              <affiliation ref="#struct-388967"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Josselin</forename>
                <surname>Vallet</surname>
              </persName>
              <email type="md5">d66889bbb5e1fe48684ce6456e53d471</email>
              <email type="domain">labri.fr</email>
              <idno type="idhal" notation="string">jason-vallet</idno>
              <idno type="idhal" notation="numeric">2508</idno>
              <idno type="halauthorid" notation="string">976268-2508</idno>
              <idno type="IDREF">https://www.idref.fr/223701661</idno>
              <affiliation ref="#struct-388967"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Olivier</forename>
                <surname>Brun</surname>
              </persName>
              <email type="md5">0a40d74b31fe666d8c75b1eada4c36eb</email>
              <email type="domain">laas.fr</email>
            </editor>
            <funder>Projet FUI NEC (AAP FUI 12)</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-02-08 13:35:16</date>
              <date type="whenModified">2025-10-22 18:04:08</date>
              <date type="whenReleased">2017-02-14 13:14:16</date>
              <date type="whenProduced">2017</date>
              <date type="whenEndEmbargoed">2017-02-08</date>
              <ref type="file" target="https://laas.hal.science/hal-01461689v1/document">
                <date notBefore="2017-02-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://laas.hal.science/hal-01461689v1/file/camera_ready.pdf" id="file-1461689-1536522">
                <date notBefore="2017-02-08"/>
              </ref>
              <ref type="externalLink" target="https://hal.laas.fr/hal-01461689/file/camera_ready.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="300575">
                <persName>
                  <forename>Olivier</forename>
                  <surname>Brun</surname>
                </persName>
                <email type="md5">0a40d74b31fe666d8c75b1eada4c36eb</email>
                <email type="domain">laas.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01461689</idno>
            <idno type="halUri">https://laas.hal.science/hal-01461689</idno>
            <idno type="halBibtex">brun:hal-01461689</idno>
            <idno type="halRefHtml">&lt;i&gt;Networks&lt;/i&gt;, 2017, Static and Dynamic Optimization Models for Network Routing Problems 69 (1), pp.52-66. &lt;a target="_blank" href="https://dx.doi.org/10.1002/net.21720"&gt;&amp;#x27E8;10.1002/net.21720&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Networks, 2017, Static and Dynamic Optimization Models for Network Routing Problems 69 (1), pp.52-66. &amp;#x27E8;10.1002/net.21720&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1461689-1536522"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLSE2">Université Toulouse 2</idno>
            <idno type="stamp" n="UNIV-TLSE3">Université de Toulouse</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INSA-TOULOUSE">Institut National des Sciences Appliquées de Toulouse</idno>
            <idno type="stamp" n="LAAS">Laboratoire d'analyse et d'architecture des systèmes</idno>
            <idno type="stamp" n="LAAS-SARA" corresp="LAAS-RISC">Équipe Services et Architectures pour Réseaux Avancés</idno>
            <idno type="stamp" n="UT1-CAPITOLE">Université Toulouse 1 Capitole</idno>
            <idno type="stamp" n="LAAS-RESEAUX-ET-COMMUNICATIONS" corresp="LAAS">LAAS-Réseaux et Communications</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="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="LAAS-RISC" corresp="LAAS">Réseaux, Informatique, Systèmes de Confiance</idno>
            <idno type="stamp" n="TOULOUSE-INP">Toulouse - INP</idno>
            <idno type="stamp" n="UNIV-UT3">Université Toulouse 3</idno>
            <idno type="stamp" n="UT3-INP">Université de Toulouse / Toulouse INP</idno>
            <idno type="stamp" n="UT3-TOULOUSEINP">Université de Toulouse / Toulouse INP</idno>
            <idno type="stamp" n="TEST7-HALCNRS">test 7 du portail hal cnrs</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>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Penalized Best-Response Algorithm for Non-Linear Single-Path Routing Problems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Brun</surname>
                  </persName>
                  <email type="md5">0a40d74b31fe666d8c75b1eada4c36eb</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">olivier-brun</idno>
                  <idno type="idhal" notation="numeric">13446</idno>
                  <idno type="halauthorid" notation="string">23862-13446</idno>
                  <idno type="IDREF">https://www.idref.fr/156351994</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4685-5306</idno>
                  <orgName ref="#struct-388967"/>
                  <affiliation ref="#struct-388967"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Balakrishna</forename>
                    <surname>Prabhu</surname>
                  </persName>
                  <email type="md5">3ab0c132f59649dd3f560e1b3e9ddc9b</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">balakrishnaprabhu</idno>
                  <idno type="idhal" notation="numeric">13979</idno>
                  <idno type="halauthorid" notation="string">29457-13979</idno>
                  <idno type="IDREF">https://www.idref.fr/092720447</idno>
                  <affiliation ref="#struct-388967"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Josselin</forename>
                    <surname>Vallet</surname>
                  </persName>
                  <email type="md5">d66889bbb5e1fe48684ce6456e53d471</email>
                  <email type="domain">labri.fr</email>
                  <idno type="idhal" notation="string">jason-vallet</idno>
                  <idno type="idhal" notation="numeric">2508</idno>
                  <idno type="halauthorid" notation="string">976268-2508</idno>
                  <idno type="IDREF">https://www.idref.fr/223701661</idno>
                  <affiliation ref="#struct-388967"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">Rapport LAAS n° 17026</idno>
                <idno type="halJournalId" status="VALID">17359</idno>
                <idno type="issn">0028-3045</idno>
                <idno type="eissn">1097-0037</idno>
                <title level="j">Networks</title>
                <imprint>
                  <publisher>Wiley</publisher>
                  <biblScope unit="serie">Static and Dynamic Optimization Models for Network Routing Problems </biblScope>
                  <biblScope unit="volume">69</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">52-66</biblScope>
                  <date type="datePub">2017</date>
                  <date type="dateEpub">2016-12-07</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1002/net.21720</idno>
              <ref type="publisher">http://onlinelibrary.wiley.com/doi/10.1002/net.21720/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Approximation algorithms</term>
                <term xml:lang="en">best response</term>
                <term xml:lang="en">single-path routing</term>
                <term xml:lang="en">game theory</term>
                <term xml:lang="en">non-linear programming</term>
                <term xml:lang="en">Nash equilibrium</term>
              </keywords>
              <classCode scheme="acm" n="G.2.2.3">G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.3: Network problems</classCode>
              <classCode scheme="acm" n="F.2.2.4">F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.4: Routing and layout</classCode>
              <classCode scheme="acm" n="G.1.6.4">G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.4: Integer programming</classCode>
              <classCode scheme="acm" n="G.1.6.7">G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization/G.1.6.7: Nonlinear programming</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-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halDomain" n="math.math-oc">Mathematics [math]/Optimization and Control [math.OC]</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>This paper is devoted to non-linear single-path routing problems, which are known to be NP-hard even in the simplest cases. For solving these problems, we propose an algorithm inspired from Game Theory in which individual flows are allowed to independently select their path to minimize their own cost function. We design the cost function of the flows so that the resulting Nash equilibrium of the game provides an efficient approximation of the optimal solution. We establish the convergence of the algorithm and show that every optimal solution is a Nash equilibrium of the game. We also prove that if the objective function is a polynomial of degree d ≥ 1, then the approximation ratio of the algorithm is (2^{1/d} − 1)^{−d}. Experimental results show that the algorithm provides single-path routings with modest relative errors with respect to optimal solutions, while being several orders of magnitude faster than existing techniques.</p>
            </abstract>
            <particDesc>
              <org type="consortium">Projet FUI NEC (AAP FUI 12)</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-388967" status="OLD">
          <orgName>Équipe Services et Architectures pour Réseaux Avancés</orgName>
          <orgName type="acronym">LAAS-SARA</orgName>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.laas.fr/public/fr/sara</ref>
          </desc>
          <listRelation>
            <relation active="#struct-459" type="direct"/>
            <relation active="#struct-81148" type="indirect"/>
            <relation name="443875" active="#struct-443875" type="indirect"/>
            <relation active="#struct-116255" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-443875" type="indirect"/>
            <relation active="#struct-116256" type="indirect"/>
            <relation active="#struct-217752" type="indirect"/>
            <relation name="UPR8001" active="#struct-441569" type="indirect"/>
            <relation active="#struct-448187" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-459" status="OLD">
          <idno type="IdRef">199278792</idno>
          <idno type="ISNI">0000 0001 2188 216X </idno>
          <idno type="RNSR">199517454Y</idno>
          <idno type="ROR">https://ror.org/03vcm6439</idno>
          <orgName>Laboratoire d'analyse et d'architecture des systèmes</orgName>
          <orgName type="acronym">LAAS</orgName>
          <date type="start">1968-01-01</date>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <addrLine>7 Av du colonel Roche 31077 TOULOUSE CEDEX 4</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.laas.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-81148" type="direct"/>
            <relation name="443875" active="#struct-443875" type="indirect"/>
            <relation active="#struct-116255" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-443875" type="indirect"/>
            <relation active="#struct-116256" type="direct"/>
            <relation active="#struct-217752" type="direct"/>
            <relation name="UPR8001" active="#struct-441569" type="direct"/>
            <relation active="#struct-448187" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-81148" status="VALID">
          <idno type="IdRef">026404354</idno>
          <idno type="ISNI">0000000121902837</idno>
          <idno type="ROR">https://ror.org/0443n9e75</idno>
          <orgName>Université Toulouse Capitole</orgName>
          <orgName type="acronym">UT Capitole</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>2 rue du Doyen-Gabriel-Marty - 31042 Toulouse Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ut-capitole.fr/</ref>
          </desc>
          <listRelation>
            <relation name="443875" active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-443875" status="VALID">
          <idno type="ROR">https://ror.org/017tgbk05</idno>
          <orgName>Communauté d'universités et établissements de Toulouse</orgName>
          <orgName type="acronym">Comue de Toulouse</orgName>
          <desc>
            <address>
              <addrLine>41 Allée Jules Guesde, 31000 Toulouse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-toulouse.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-116255" status="VALID">
          <idno type="IdRef">026388766</idno>
          <idno type="ISNI">0000 0001 2286 8343</idno>
          <idno type="ROR">https://ror.org/01h8pf755</idno>
          <idno type="Wikidata">Q858979</idno>
          <orgName>Institut National des Sciences Appliquées - Toulouse</orgName>
          <orgName type="acronym">INSA Toulouse</orgName>
          <date type="start">1963-10-21</date>
          <desc>
            <address>
              <addrLine>135, avenue de Rangueil - 31077 Toulouse cedex 4</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-toulouse.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-116256" status="VALID">
          <idno type="IdRef">026403994</idno>
          <idno type="ROR">https://ror.org/04ezk3x31</idno>
          <orgName>Université Toulouse - Jean Jaurès</orgName>
          <orgName type="acronym">UT2J</orgName>
          <date type="start">1971-01-01</date>
          <desc>
            <address>
              <addrLine>5 allées Antonio Machado - 31058 Toulouse Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tlse2.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-217752" status="OLD">
          <idno type="IdRef">026404672</idno>
          <idno type="ISNI">0000000121617331</idno>
          <idno type="ROR">https://ror.org/02v6kpv12</idno>
          <idno type="Wikidata">Q1273188</idno>
          <orgName>Université Toulouse III - Paul Sabatier</orgName>
          <orgName type="acronym">UT3</orgName>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <addrLine>118 route de Narbonne - 31062 Toulouse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tlse3.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </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-448187" status="VALID">
          <idno type="IdRef">026388820</idno>
          <idno type="ISNI">0000000121766169</idno>
          <idno type="ROR">https://ror.org/033p9g875</idno>
          <orgName>Institut National Polytechnique (Toulouse)</orgName>
          <orgName type="acronym">Toulouse INP</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inp-toulouse.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>