Pages that link to "Item:Q2661522"

The following pages link to A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522):

Displaying 3 items.

• Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
• Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
• Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)