Weighted fair division of indivisible items: a review
From MaRDI portal
Publication:6602330
Recommendations
Cites work
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Almost envy-freeness with general valuations
- Approximation algorithms for the weighted Nash social welfare via convex and non-convex programs
- Breaking the 3/4 barrier for approximate maximin share
- Cake-cutting with different entitlements: how many cuts are needed?
- Competitive equilibrium with indivisible goods and generic budgets
- Disproportionate division
- Fair Allocation of Indivisible Goods
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Fair allocation of indivisible goods: beyond additive valuations
- Fair division of indivisible goods: recent progress and open questions
- Fair division with binary valuations: one rule to rule them all
- Fair enough: guaranteeing approximate maximin shares
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- On maximum weighted Nash welfare for binary valuations
- Picking sequences and monotonicity in weighted fair division
- Proportional representation. Apportionment methods and their applications. With a foreword by Andrew Duff
- Strategy-proofness, solidarity, and consistency for multiple assignment problems
- Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness
Cited in
(1)
This page was built for publication: Weighted fair division of indivisible items: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602330)