License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2021.24
URN: urn:nbn:de:0030-drops-140939
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14093/
Batziou, Eleni ;
Hansen, Kristoffer Arnsfelt ;
Høgh, Kasper
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
Abstract
In the consensus halving problem we are given n agents with valuations over the interval [0,1]. The goal is to divide the interval into at most n+1 pieces (by placing at most n cuts), which may be combined to give a partition of [0,1] into two sets valued equally by all agents. The existence of a solution may be established by the Borsuk-Ulam theorem. We consider the task of computing an approximation of an exact solution of the consensus halving problem, where the valuations are given by distribution functions computed by algebraic circuits. Here approximation refers to computing a point that is ε-close to an exact solution, also called strong approximation. We show that this task is polynomial time equivalent to computing an approximation to an exact solution of the Borsuk-Ulam search problem defined by a continuous function that is computed by an algebraic circuit.
The Borsuk-Ulam search problem is the defining problem of the complexity class BU. We introduce a new complexity class BBU to also capture an alternative formulation of the Borsuk-Ulam theorem from a computational point of view. We investigate their relationship and prove several structural results for these classes as well as for the complexity class FIXP.
BibTeX - Entry
@InProceedings{batziou_et_al:LIPIcs.ICALP.2021.24,
author = {Batziou, Eleni and Hansen, Kristoffer Arnsfelt and H{\o}gh, Kasper},
title = {{Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14093},
URN = {urn:nbn:de:0030-drops-140939},
doi = {10.4230/LIPIcs.ICALP.2021.24},
annote = {Keywords: Consensus halving, Computational Complexity, Borsuk-Ulam}
}
|
Keywords: |
|
Consensus halving, Computational Complexity, Borsuk-Ulam |
|
Collection: |
|
48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
02.07.2021 |
