The following pages link to (Q5005124):
Displayed 8 items.
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Understanding PPA-completeness (Q2208253) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)