The Price of Connectivity in Fair Division
From MaRDI portal
Publication:5864211
DOI10.1137/20M1388310zbMath1492.91153arXiv1908.05433MaRDI QIDQ5864211
Ayumi Igarashi, Warut Suksompong, Xinhang Lu, Xiaohui Bei
Publication date: 3 June 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.05433
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Connectivity (05C40)
Related Items (5)
Keep your distance: land division with separation ⋮ Fair division of graphs and of tangled cakes ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Democratic fair allocation of indivisible goods ⋮ Mind the gap: cake cutting with separation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On partitioning a graph into two connected subgraphs
- Two-player fair division of indivisible items: comparison of algorithms
- Partitioning graphs into connected parts
- On the complexity of partitioning graphs into connected subgraphs
- Computing an st-numbering
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- On maximin share allocations in matroids
- A simple test on 2-vertex- and 2-edge-connectivity
- Almost envy-free allocations with connected bundles
- Envy-free allocations respecting social networks
- Almost envy-freeness in group resource allocation
- Democratic fair allocation of indivisible goods
- Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Impartial division of a dollar
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
- Non-Separable and Planar Graphs
- Fair Enough
- Fair Allocation of Indivisible Goods: Improvement
- Closing Gaps in Asymptotic Fair Division
- Fairly Allocating Many Goods with Few Queries
- Almost Envy-Freeness with General Valuations
- Maximin Share Allocations on Cycles
- When Do Envy-Free Allocations Exist?
- Communication Complexity of Discrete Fair Division
- Fairly allocating contiguous blocks of indivisible items
This page was built for publication: The Price of Connectivity in Fair Division
