Pages that link to "Item:Q4554942"
From MaRDI portal
The following pages link to Approximation Algorithms for Computing Maximin Share Allocations (Q4554942):
Displaying 36 items.
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Sharing-group allocation problems (Q1927716) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
- A tight negative example for MMS fair allocations (Q2152130) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
- An improved approximation algorithm for maximin shares (Q2238718) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- Finding maxmin allocations in cooperative and competitive fair division (Q2259025) (← links)
- Computing a small agreeable set of indivisible items (Q2321268) (← links)
- Envy-freeness in house allocation problems (Q2334840) (← links)
- Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
- Fair multi-cake cutting (Q2659057) (← links)
- Fair allocation of indivisible goods: beyond additive valuations (Q2667816) (← links)
- Approximate competitive equilibrium with generic budget (Q2670929) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- An Efficient Approximation Algorithm for Maximum Simple Sharing Problem (Q3406336) (← links)
- (Q3487147) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q4957912) (← links)
- Fair Allocation of Indivisible Goods: Improvement (Q4958554) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- Efficient Fair Division with Minimal Sharing (Q5095173) (← links)
- Maximin Share Allocations on Cycles (Q5130018) (← links)
- When Do Envy-Free Allocations Exist? (Q5130903) (← links)
- Existence of EFX for two additive valuations (Q6094718) (← 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)
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
- Envy-free matchings in bipartite graphs and their applications to fair division (Q6154777) (← links)
- On best-of-both-worlds fair-share allocations (Q6167252) (← links)
- Maximin fair allocation of indivisible items under cost utilities (Q6546293) (← links)
