Two's company, three's a crowd: consensus-halving for a constant number of agents

Cites Work

The complexity of computing a Nash equilibrium
Rental Harmony: Sperner's Lemma in Fair Division
On the Complexity of Nash Equilibria and Other Fixed Points
On the complexity of the parity argument and other inefficient proofs of existence
Settling the complexity of computing two-player Nash equilibria
Title not available (Why is that?)
On total functions, existence theorems and computational complexity
The relative complexity of NP search problems
Title not available (Why is that?)
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
Fair Allocation of Indivisible Goods
Cake cutting algorithms
A Moment Problem in L 1 Approximation
Title not available (Why is that?)
Drei Sätze über die n-dimensionale euklidische Sphäre
Splitting necklaces
Sur la division pragmatique
On the complexity of cake cutting
Title not available (Why is that?)
Title not available (Why is that?)
Bisection of Circle Colorings
The Borsuk-Ulam Theorem and Bisection of Necklaces
Algorithmic solutions for envy-free cake cutting
A discrete and bounded envy-free cake cutting protocol for four agents
Contiguous cake cutting: hardness results and approximation algorithms
A Sperner lemma complete for PPA
Discrete fixed points: models, complexities, and applications
Consensus-halving via theorems of Borsuk-Ulam and Tucker
Title not available (Why is that?)
Approximating fair division with a limited number of cuts
An improved envy-free cake cutting protocol for four agents
Consensus halving is PPA-complete
Hardness results for consensus-halving
2-D Tucker is PPA complete
Matching algorithmic bounds for finding a Brouwer fixed point
The complexity of splitting necklaces and bisecting ham sandwiches
Consensus halving for sets of items
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
Simplotopal maps and necklace splitting
Measure partitions using hyperplanes with fixed directions
White-box vs. black-box complexity of search problems: Ramsey and graph property testing
Fair Cake Division Under Monotone Likelihood Ratios
The complexity of gradient descent: CLS = PPAD ∩ PLS

Cited In (1)

Consensus-Halving: Does It Ever Get Easier?

This page was built for publication: Two's company, three's a crowd: consensus-halving for a constant number of agents

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