An improved approximation algorithm for maximin shares
From MaRDI portal
Recommendations
Cites work
- A Little Charity Guarantees Almost Envy-Freeness
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Approximation Algorithms for Computing Maximin Share Allocations
- Equilibrium pricing with positive externalities
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Fair enough: guaranteeing approximate maximin shares
- Maximin share allocations on cycles
- On maximin share allocations in matroids
- The fair division of hereditary set systems
Cited in
(28)- Fair allocation of indivisible goods: improvement
- Restricted existence and approximation algorithms for PMMS
- Approximate maximin share allocation for indivisible goods under a knapsack constraint
- Ordinal Maximin Share Approximation for Goods
- Fair allocation of indivisible goods: beyond additive valuations
- The budgeted maximin share allocation problem
- Fair and truthful allocations under leveled valuations
- Maximin share allocation under knapsack constraints
- Faster min-max resource sharing in theory and practice
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On best-of-both-worlds fair-share allocations
- On maximin share allocations in matroids
- Envy-free and efficient allocations for graphical valuations
- Approximating maximin share allocations
- Approximate maximin share allocations in matroids
- A tight negative example for MMS fair allocations
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- Approximation algorithms for computing maximin share allocations
- Fair and efficient graphical resource allocation with matching-induced utilities
- Improved approximation of maximin share fair allocation under generalized assignment constraints
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair division of indivisible goods: recent progress and open questions
- Teams formation: efficiency and approximate fairness
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- An Efficient Approximation Algorithm for Maximum Simple Sharing Problem
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences
- Maximin fair allocation of indivisible items under cost utilities
This page was built for publication: An improved approximation algorithm for maximin shares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238718)
