Pages that link to "Item:Q2238718"
From MaRDI portal
The following pages link to An improved approximation algorithm for maximin shares (Q2238718):
Displaying 14 items.
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- A tight negative example for MMS fair allocations (Q2152130) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- An Efficient Approximation Algorithm for Maximum Simple Sharing Problem (Q3406336) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q4554942) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences (Q6120928) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- On best-of-both-worlds fair-share allocations (Q6167252) (← links)
- Maximin fair allocation of indivisible items under cost utilities (Q6546293) (← links)