Optimal error resilience of adaptive message exchange
| Autor: | Klim Efremenko, Raghuvansh R. Saxena, Gillat Kol |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Mathematical optimization
Computer science 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology 01 natural sciences Set (abstract data type) Task (computing) 010201 computation theory & mathematics Channel (programming) 0202 electrical engineering electronic engineering information engineering Fraction (mathematics) Communication complexity Resilience (network) Constant (mathematics) Protocol (object-oriented programming) |
| Zdroj: | STOC |
| DOI: | 10.1145/3406325.3451077 |
| Popis: | We study the error resilience of the message exchange task: Two parties, each holding a private input, want to exchange their inputs. However, the channel connecting them is governed by an adversary that may corrupt a constant fraction of the transmissions. What is the maximum fraction of corruptions that still allows the parties to exchange their inputs? For the non-adaptive channel, where the parties must agree in advance on the order in which they communicate, the maximum error resilience was shown to be 1/4 (see Braverman and Rao, STOC 2011). The problem was also studied over the adaptive channel, where the order in which the parties communicate may not be predetermined (Ghaffari, Haeupler, and Sudan, STOC 2014; Efremenko, Kol, and Saxena, STOC 2020). These works show that the adaptive channel admits much richer set of protocols but leave open the question of finding its maximum error resilience. In this work, we show that the maximum error resilience of a protocol for message exchange over the adaptive channel is 5/16, thereby settling the above question. Our result requires improving both the known upper bounds and the known lower bounds for the problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|