The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications

DOI10.1137/1.9781611974782.87MaRDI QIDQ4575830zbMATH OpenOpenAlexFDO

Authors Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.01921

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Let $C_1,\mathrm{...},C_{d+1}$ be $d+1$ point sets in $mathbb{R}^d$, each containing the origin in its convex hull. A subset $C$ of $$ is called a colorful choice (or rainbow) for $C_1,dots,C_{d+1}$, if it contains exactly one point from each set $C_i$. The colorful Carath'eodory theorem states that there always exists a colorful choice for $C_1,dots,C_{d+1}$ that has the origin in its convex hull. This theorem is very general and can be used to prove several other existence theorems in high-dimensional discrete geometry, such as the centerpoint theorem or Tverberg's theorem. The colorful Carath'eodory problem (CCP) is the computational problem of finding such a colorful choice. Despite several efforts in the past, the computational complexity of CCP in arbitrary dimension is still open. We show that CCP lies in the intersection of the complexity classes PPAD and PLS. This makes it one of the few geometric problems in PPAD and PLS that are not known to be solvable in polynomial time. Moreover, it implies that the problem of computing centerpoints, computing Tverberg partitions, and computing points with large simplicial depth is contained in $extPPADcapextPLS$. This is the first nontrivial upper bound on the complexity of these problems. Finally, we show that our PPAD formulation leads to a polynomial-time algorithm for a special case of CCP in which we have only two color classes $C_1$ and $C_2$ in $d$ dimensions, each with the origin in its convex hull, and we would like to find a set with half the points from each color class that contains the origin in its convex hull.

Recommendations

• Computational aspects of the colorful Carathéodory theorem
• scientific article; zbMATH DE number 6789180
• Colorful linear programming, Nash equilibrium, and pivots
• Colourful Linear Programming and its Relatives
• Colourful linear programming

Cited in

(17)

• Colorful linear programming, Nash equilibrium, and pivots
• Computational aspects of the colorful Carathéodory theorem
• No-dimensional Tverberg theorems and algorithms
• Unique end of potential line
• Colourful Linear Programming and its Relatives
• Colourful linear programming
• The crossing Tverberg theorem
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Helly-type problems
• Fully polynomial-time approximation schemes for fair rent division
• scientific article; zbMATH DE number 7662163 (Why is no real title available?)
• Further collapses in \(\mathsf{TFNP}\)
• The complexity of gradient descent: CLS = PPAD pls
• The crossing Tverberg theorem
• Computational complexity of the -Ham-Sandwich problem
• No-dimensional Tverberg partitions revisited
• Settling the complexity of Nash equilibrium in congestion games

This page was built for publication: The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575830)