Pages that link to "Item:Q2450092"
From MaRDI portal
The following pages link to The undercut procedure: an algorithm for the envy-free division of indivisible items (Q2450092):
Displaying 18 items.
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Proportional Borda allocations (Q682476) (← links)
- Two-player fair division of indivisible items: comparison of algorithms (Q724147) (← links)
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- A note on the undercut procedure (Q904826) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Agreeable sets with matroidal constraints (Q2424653) (← links)
- Fair allocation of indivisible goods: the two-agent case (Q2453428) (← links)
- Fair cake-cutting for imitative agents (Q2673785) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Fair Division (Q5150295) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)