Fairly allocating contiguous blocks of indivisible items
From MaRDI portal
Publication:5894699
DOI10.1007/978-3-319-66700-3_26zbMath1403.91216arXiv1707.00345OpenAlexW2731670322MaRDI QIDQ5894699
Publication date: 13 February 2018
Published in: Discrete Applied Mathematics, Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.00345
fair divisionproportionalityenvy-freenesscontiguous blocksequitabilityfair allocation of indivisible items
Related Items
Envy-free allocations respecting social networks, Fair and efficient allocation with few agent types, few item types, or small value levels, Computing welfare-maximizing fair allocations of indivisible goods, On Fair Division under Heterogeneous Matroid Constraints, Fairly taking turns, Almost envy-freeness in group resource allocation, Contiguous Cake Cutting: Hardness Results and Approximation Algorithms, The price of fairness for indivisible goods, Approximate maximin shares for groups of agents, Unnamed Item, Democratic fair allocation of indivisible goods, Allocating contiguous blocks of indivisible chores fairly, Fairly Allocating Many Goods with Few Queries, Almost envy-free allocations with connected bundles, On the number of almost envy-free allocations, The Price of Connectivity in Fair Division
Cites Work
- Unnamed Item
- Asymptotic existence of proportionally fair allocations
- Dividing connected chores fairly
- The efficiency of fair division
- The price of envy-freeness in machine scheduling
- Envy-free cake divisions cannot be found by finite protocols
- Splitting necklaces
- Asymptotic existence of fair divisions for groups
- On the computability of equitable divisions
- Almost envy-freeness in group resource allocation
- Block partitions of sequences
- On the existence of equitable cake divisions
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
