The following pages link to (Q5874477):
Displaying 8 items.
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q4957912) (← links)
- Fair Division of Indivisible Goods for a Class of Concave Valuations (Q5094007) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Dividing good and great items among agents with bivalued submodular valuations (Q6609141) (← links)
- Online Nash welfare maximization without predictions (Q6609160) (← links)
