The following pages link to (Q5090386):
Displaying 12 items.
- On the number of almost envy-free allocations (Q777445) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Envy-free cake division without assuming the players prefer nonempty pieces (Q2279957) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- Consensus Halving for Sets of Items (Q5870379) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- Existence of EFX for two additive valuations (Q6094718) (← links)
- On Fair Division under Heterogeneous Matroid Constraints (Q6135949) (← links)
