Teams formation: efficiency and approximate fairness
From MaRDI portal
Cites work
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Almost envy-freeness with general valuations
- An improved approximation algorithm for maximin shares
- Best of both worlds: ex ante and ex post fairness in resource allocation
- Breaking the 3/4 barrier for approximate maximin share
- On Fair Division under Heterogeneous Matroid Constraints
- Picking sequences and monotonicity in weighted fair division
- Proportional allocation of indivisible goods up to the least valued good on average
This page was built for publication: Teams formation: efficiency and approximate fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911057)