Pages that link to "Item:Q5894699"
From MaRDI portal
The following pages link to Fairly allocating contiguous blocks of indivisible items (Q5894699):
Displaying 20 items.
- On the number of almost envy-free allocations (Q777445) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Envy-free allocations respecting social networks (Q2124438) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- Democratic fair allocation of indivisible goods (Q2289012) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
- (Q5090386) (← links)
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- (Q5915991) (redirect page) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- On Fair Division under Heterogeneous Matroid Constraints (Q6135949) (← links)
- Fairly taking turns (Q6148409) (← links)
- EFX allocation to chores over small graph (Q6606239) (← links)
- Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)
- Dividing a graphical cake (Q6668347) (← links)
