<?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-02500370</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-22T09:03:27+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Online Computation with Untrusted Advice</title>
            <author role="aut">
              <persName>
                <forename type="first">Spyros</forename>
                <surname>Angelopoulos</surname>
              </persName>
              <email type="md5">093cd5f8095e9473209010113ec8b952</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">spyros-angelopoulos</idno>
              <idno type="idhal" notation="numeric">738275</idno>
              <idno type="halauthorid" notation="string">26508-738275</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
              <idno type="IDREF">https://www.idref.fr/250394448</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christoph</forename>
                <surname>Dürr</surname>
              </persName>
              <email type="md5">c180ef5eb575595d447b191373ac362f</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">christoph-durr</idno>
              <idno type="idhal" notation="numeric">5030</idno>
              <idno type="halauthorid" notation="string">26507-5030</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8103-5333</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=71NSquIAAAAJ&amp;hl=fr&amp;oi=ao</idno>
              <idno type="IDREF">https://www.idref.fr/135934842</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shahin</forename>
                <surname>Kamali</surname>
              </persName>
              <idno type="halauthorid">1051799-0</idno>
              <affiliation ref="#struct-300724"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shendan</forename>
                <surname>Jin</surname>
              </persName>
              <idno type="halauthorid">1549522-0</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Marc</forename>
                <surname>Renault</surname>
              </persName>
              <idno type="halauthorid">1051800-0</idno>
              <affiliation ref="#struct-44110"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Spyros</forename>
                <surname>Angelopoulos</surname>
              </persName>
              <email type="md5">093cd5f8095e9473209010113ec8b952</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-03-05 18:58:30</date>
              <date type="whenModified">2024-10-30 13:32:41</date>
              <date type="whenReleased">2020-03-05 18:58:30</date>
              <date type="whenProduced">2020-01-12</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1905.05655"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="450257">
                <persName>
                  <forename>Spyros</forename>
                  <surname>Angelopoulos</surname>
                </persName>
                <email type="md5">093cd5f8095e9473209010113ec8b952</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02500370</idno>
            <idno type="halUri">https://hal.science/hal-02500370</idno>
            <idno type="halBibtex">angelopoulos:hal-02500370</idno>
            <idno type="halRefHtml">&lt;i&gt;11th Innovations in Theoretical Computer Science Conference (ITCS 2020)&lt;/i&gt;, Jan 2020, Seattle, United States. pp.52:1--52:15, &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.ITCS.2020.52"&gt;&amp;#x27E8;10.4230/LIPIcs.ITCS.2020.52&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Jan 2020, Seattle, United States. pp.52:1--52:15, &amp;#x27E8;10.4230/LIPIcs.ITCS.2020.52&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="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</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">Online Computation with Untrusted Advice</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Spyros</forename>
                    <surname>Angelopoulos</surname>
                  </persName>
                  <email type="md5">093cd5f8095e9473209010113ec8b952</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">spyros-angelopoulos</idno>
                  <idno type="idhal" notation="numeric">738275</idno>
                  <idno type="halauthorid" notation="string">26508-738275</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
                  <idno type="IDREF">https://www.idref.fr/250394448</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christoph</forename>
                    <surname>Dürr</surname>
                  </persName>
                  <email type="md5">c180ef5eb575595d447b191373ac362f</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">christoph-durr</idno>
                  <idno type="idhal" notation="numeric">5030</idno>
                  <idno type="halauthorid" notation="string">26507-5030</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8103-5333</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=71NSquIAAAAJ&amp;hl=fr&amp;oi=ao</idno>
                  <idno type="IDREF">https://www.idref.fr/135934842</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shahin</forename>
                    <surname>Kamali</surname>
                  </persName>
                  <idno type="halauthorid">1051799-0</idno>
                  <affiliation ref="#struct-300724"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shendan</forename>
                    <surname>Jin</surname>
                  </persName>
                  <idno type="halauthorid">1549522-0</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Marc</forename>
                    <surname>Renault</surname>
                  </persName>
                  <idno type="halauthorid">1051800-0</idno>
                  <affiliation ref="#struct-44110"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>11th Innovations in Theoretical Computer Science Conference (ITCS 2020)</title>
                  <date type="start">2020-01-12</date>
                  <date type="end">2020-01-14</date>
                  <settlement>Seattle</settlement>
                  <country key="US">United States</country>
                </meeting>
                <editor>Thomas Vidick</editor>
                <imprint>
                  <publisher>Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik</publisher>
                  <biblScope unit="serie">Leibniz International Proceedings in Informatics (LIPIcs)</biblScope>
                  <biblScope unit="volume">151</biblScope>
                  <biblScope unit="pp">52:1--52:15</biblScope>
                </imprint>
              </monogr>
              <idno type="arxiv">1905.05655</idno>
              <idno type="doi">10.4230/LIPIcs.ITCS.2020.52</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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>The advice model of online computation captures the setting in which the online algorithm is given some partial information concerning the request sequence. This paradigm allows to establish tradeoffs between the amount of this additional information and the performance of the online algorithm. However, unlike real life in which advice is a recommendation that we can choose to follow or to ignore based on trustworthiness, in the current advice model, the online algorithm treats it as infallible. This means that if the advice is corrupt or, worse, if it comes from a malicious source, the algorithm may perform poorly. In this work, we study online computation in a setting in which the advice is provided by an untrusted source. Our objective is to quantify the impact of untrusted advice so as to design and analyze online algorithms that are robust and perform well even when the advice is generated in a malicious, adversarial manner. To this end, we focus on well- studied online problems such as ski rental, online bidding, bin packing, and list update. For ski-rental and online bidding, we show how to obtain algorithms that are Pareto-optimal with respect to the competitive ratios achieved; this improves upon the framework of Purohit et al. [NeurIPS 2018] in which Pareto-optimality is not necessarily guaranteed. For bin packing and list update, we give online algorithms with worst-case tradeoffs in their competitiveness, depending on whether the advice is trusted or not; this is motivated by work of Lykouris and Vassilvitskii [ICML 2018] on the paging problem, but in which the competitiveness depends on the reliability of the advice. Furthermore, we demonstrate how to prove lower bounds, within this model, on the tradeoff between the number of advice bits and the competitiveness of any online algorithm. Last, we study the effect of randomization: here we show that for ski-rental there is a randomized algorithm that Pareto-dominates any deterministic algorithm with advice of any size. We also show that a single random bit is not always inferior to a single advice bit, as it happens in the standard model.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300724" status="VALID">
          <orgName>University of Manitoba [Winnipeg]</orgName>
          <date type="start">2017-04-10</date>
          <desc>
            <address>
              <addrLine>Winnipeg, Manitoba Canada  R3T 2N2</addrLine>
              <country key="CA"/>
            </address>
            <ref type="url">http://umanitoba.ca/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-44110" status="VALID">
          <idno type="ROR">https://ror.org/01y2jtd41</idno>
          <orgName>University of Wisconsin-Madison</orgName>
          <desc>
            <address>
              <addrLine>Madison, WI 53706</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.wisc.edu/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.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>
    </back>
  </text>
</TEI>