Pages that link to "Item:Q724147"
From MaRDI portal
The following pages link to Two-player fair division of indivisible items: comparison of algorithms (Q724147):
Displaying 15 items.
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Proportional Borda allocations (Q682476) (← links)
- A general branch-and-bound algorithm for fair division problems (Q991365) (← links)
- Fair choice sequences (Q1639604) (← links)
- Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
- A correspondence between voting procedures and stochastic orderings (Q2184056) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Using the Borda rule for ranking sets of objects (Q2325666) (← links)
- How to Divide Things Fairly (Q2956577) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Stability and welfare in (dichotomous) hedonic diversity games (Q6185603) (← links)
- Comparing algorithms for fair allocation of indivisible items with limited information (Q6201671) (← links)