Pages that link to "Item:Q1810715"
From MaRDI portal
The following pages link to Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715):
Displaying 29 items.
- A combinatorial analog of a theorem of F.J. Dyson (Q975232) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Resource-monotonicity and population-monotonicity in connected cake-cutting (Q1737122) (← links)
- A polytopal generalization of Sperner's lemma (Q1865380) (← links)
- On the computability of equitable divisions (Q1926490) (← links)
- The complexity of finding fair independent sets in cycles (Q2087771) (← links)
- Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
- Discrete versions of the KKM lemma and their PPAD-completeness (Q2097223) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- Two-player envy-free multi-cake division (Q2270332) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Existence of a simple and equitable fair division: a short proof (Q2406943) (← links)
- The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics (Q2497969) (← links)
- A constructive proof of Ky Fan's generalization of Tucker's lemma (Q2566806) (← links)
- Proving Tucker’s Lemma with a volume argument (Q2979657) (← links)
- A near equitable 2-person cake cutting algorithm (Q3145047) (← links)
- A user's guide to the topological Tverberg conjecture (Q4684242) (← links)
- (Q5005124) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Multilabeled Versions of Sperner's and Fan's Lemmas and Applications (Q5234532) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- Cutting a Cake Fairly for Groups Revisited (Q5880265) (← links)
- Consensus-Halving: Does It Ever Get Easier? (Q5890032) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Fixed-Parameter Algorithms for the Kneser and Schrijver Problems (Q6154195) (← links)
