Pages that link to "Item:Q3448772"
From MaRDI portal
The following pages link to Approximation Algorithms for Computing Maximin Share Allocations (Q3448772):
Displaying 15 items.
- Asymptotic existence of proportionally fair allocations (Q277310) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Asymptotic existence of fair divisions for groups (Q1680744) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Sharing-group allocation problems (Q1927716) (← links)
- Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- An Efficient Approximation Algorithm for Maximum Simple Sharing Problem (Q3406336) (← links)
- (Q3487147) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q4554942) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Approximate Maximin Share Allocations in Matroids (Q5283377) (← links)
- Collective decision making (Q6602233) (← links)