Pages that link to "Item:Q2661522"
From MaRDI portal
The following pages link to A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522):
Displayed 8 items.
- Picking sequences and monotonicity in weighted fair division (Q2060703) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores (Q2670938) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Fair in the Eyes of Others (Q5870502) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Approximately EFX allocations for indivisible chores (Q6152663) (← links)