Picking sequences and monotonicity in weighted fair division
From MaRDI portal
Publication:2060703
DOI10.1016/j.artint.2021.103578zbMath1481.91090arXiv2104.14347OpenAlexW3158522089MaRDI QIDQ2060703
Ulrike Schmidt-Kraepelin, Mithun Chakraborty, Warut Suksompong
Publication date: 13 December 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.14347
Related Items (6)
Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ On maximum weighted Nash welfare for binary valuations ⋮ Keep your distance: land division with separation ⋮ Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness ⋮ Picking sequences and monotonicity in weighted fair division ⋮ Mind the gap: cake cutting with separation
Cites Work
- Unnamed Item
- Unnamed Item
- Welfare bounds in the fair division problem
- The complexity of cake cutting with unequal shares
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Picking sequences and monotonicity in weighted fair division
- Monotonicity and competitive equilibrium in cake-cutting
- Cake-cutting with different entitlements: how many cuts are needed?
- Maximum Nash welfare and other stories about EFX
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- Fair division with binary valuations: one rule to rule them all
- Proportional Representation
- The Quota Method of Apportionment
- Fair Enough
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- Fair Allocation of Indivisible Goods
- Disproportionate division
This page was built for publication: Picking sequences and monotonicity in weighted fair division
