Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

03/07/2019
by   Argyrios Deligkas, et al.
0

We study the problem of finding an exact solution to the consensus halving problem. While recent work has shown that the approximate version of this problem is PPA-complete, we show that the exact version is much harder. Specifically, finding a solution with n cuts is FIXP-hard, and deciding whether there exists a solution with fewer than n cuts is ETR-complete. We also give a QPTAS for the case where each agent's valuation is a polynomial. Along the way, we define a new complexity class BU, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly. We show that FIXP ⊆ BU ⊆ TFETR and that LinearBU = PPA, where LinearBU is the subclass of BU in which the Borsuk-Ulam instance is specified by a linear arithmetic circuit.

READ FULL TEXT
research
03/07/2021

Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

In the consensus halving problem we are given n agents with valuations o...
research
11/13/2017

Consensus Halving is PPA-Complete

We show that the computational problem CONSENSUS-HALVING is PPA-complete...
research
10/20/2019

The exact complexity of the Tutte polynomial

This is a survey on the exact complexity of computing the Tutte polynomi...
research
05/16/2021

A Complete algorithm for local inversion of maps: Application to Cryptanalysis

For a map (function) F(x):^n→^n and a given y in the image of F the prob...
research
05/18/2021

Kemeny Consensus Complexity

The computational study of election problems generally focuses on questi...
research
02/13/2022

Consensus Division in an Arbitrary Ratio

We consider the problem of partitioning a line segment into two subsets,...
research
12/28/2020

Square-Cut Pizza Sharing is PPA-complete

We study the computational complexity of computing solutions for the squ...

Please sign up or login with your details

Forgot password? Click here to reset