<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-08T01:22:03Z</responseDate>
  <request identifier="26446" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:26446</identifier>
        <datestamp>2026-09-05T19:44:07Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Tight Regret Bounds for Fixed-Price Bilateral Trade</dc:title>
          <dc:creator>Chen, Houshuang</dc:creator>
          <dc:creator>Jin, Yaonan</dc:creator>
          <dc:creator>Lu, Pinyan</dc:creator>
          <dc:creator>Zhang, Chihao</dc:creator>
          <dc:subject>bilateral trade</dc:subject>
          <dc:subject>online learning</dc:subject>
          <dc:subject>regret minimization</dc:subject>
          <dc:subject>budget balance</dc:subject>
          <dc:description>We examine fixed-price mechanisms in bilateral trade through the lens of regret minimization. Our main results are twofold. (i) For independent values, a near-optimal Θ̃(T^{2/3}) tight bound for Global Budget Balance fixed-price mechanisms with two-bit/one-bit feedback. (ii) For correlated/adversarial values, a near-optimal Ω(T^{3/4}) lower bound for Global Budget Balance fixed-price mechanisms with two-bit/one-bit feedback, which improves the best known Ω(T^{5/7}) lower bound obtained in the work [Martino Bernasconi et al., 2024] and, up to polylogarithmic factors, matches the 𝒪̃(T^{3/4}) upper bound obtained in the same work. Our work in combination with the previous works [Nicolò Cesa{-}Bianchi et al., 2024; Nicolò Cesa-Bianchi et al., 2024; Yossi Azar et al., 2024; Martino Bernasconi et al., 2024] (essentially) gives a thorough understanding of regret minimization for fixed-price bilateral trade.&#13;
En route, we have developed two technical ingredients that might be of independent interest: (i) A novel algorithmic paradigm, called fractal elimination, to address one-bit feedback and independent values. (ii) A new lower-bound construction with novel proof techniques, to address the Global Budget Balance constraint and correlated values.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Houshuang Chen and Yaonan Jin and Pinyan Lu and Chihao Zhang</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.ICALP.2026.57</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-264462</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.57</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
