Two's company, three's a crowd: consensus-halving for a constant number of agents
From MaRDI portal
Publication:2093385
DOI10.1016/j.artint.2022.103784OpenAlexW3045663689MaRDI QIDQ2093385
Alexandros Hollender, Aris Filos-Ratsikas, Argyrios Deligkas
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.15125
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On total functions, existence theorems and computational complexity
- Splitting necklaces
- The relative complexity of NP search problems
- On the complexity of the parity argument and other inefficient proofs of existence
- A Sperner lemma complete for PPA
- An improved envy-free cake cutting protocol for four agents
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Approximating fair division with a limited number of cuts
- 2-D Tucker is PPA complete
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Simplotopal maps and necklace splitting
- On the complexity of cake cutting
- Measure partitions using hyperplanes with fixed directions
- Consensus halving for sets of items
- Rental Harmony: Sperner's Lemma in Fair Division
- Discrete Fixed Points: Models, Complexities, and Applications
- On the Complexity of Nash Equilibria and Other Fixed Points
- Bisection of Circle Colorings
- Settling the complexity of computing two-player Nash equilibria
- Matching algorithmic bounds for finding a Brouwer fixed point
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Algorithmic Solutions for Envy-Free Cake Cutting
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Fair Allocation of Indivisible Goods
- Cake Cutting Algorithms
- The Complexity of Computing a Nash Equilibrium
- The complexity of splitting necklaces and bisecting ham sandwiches
- White-Box vs. Black-Box Complexity of Search Problems
- Consensus halving is PPA-complete
- A discrete and bounded envy-free cake cutting protocol for four agents
- A Moment Problem in L 1 Approximation
- Sur la division pragmatique
- Fair Cake Division Under Monotone Likelihood Ratios
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- The complexity of gradient descent: CLS = PPAD ∩ PLS
This page was built for publication: Two's company, three's a crowd: consensus-halving for a constant number of agents
