Fair division of mixed divisible and indivisible goods
From MaRDI portal
Publication:2238609
DOI10.1016/j.artint.2020.103436OpenAlexW2983148641MaRDI QIDQ2238609
Shengxin Liu, Xinhang Lu, Xiaohui Bei, Jinyan Liu, Zi-Hao Li
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07048
Related Items (3)
Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Allocating contiguous blocks of indivisible chores fairly
Cites Work
- Unnamed Item
- Unnamed Item
- Truth, justice, and cake cutting
- A note on cake cutting
- Truthful fair division without free disposal
- Brams-Taylor model of fair division for divisible and indivisible items
- Fair division of a measurable space
- Splitting necklaces
- Welfare bounds in the fair division problem
- Envy-free and Pareto efficient allocations in economies with indivisible goods and money
- On the computability of equitable divisions
- Fair division with subsidy
- Monotonicity and competitive equilibrium in cake-cutting
- An algorithm for envy-free allocations in an economy with indivisible objects and money
- Maximum Nash welfare and other stories about EFX
- Rental Harmony: Sperner's Lemma in Fair Division
- Fair Allocation of Indivisible Goods and Criteria of Justice
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Approximation Algorithms for Computing Maximin Share Allocations
- Fair Enough
- An Envy-Free Cake Division Protocol
- Almost Envy-Freeness with General Valuations
- Introduction to the Theory of Fair Allocation
- Cake Cutting Algorithms
- A discrete and bounded envy-free cake cutting protocol for four agents
- Cake cutting really is not a piece of cake
This page was built for publication: Fair division of mixed divisible and indivisible goods
