Fair Division with Subjective Divisibility
Xiaohui Bei, Shengxin Liu, Xinhang Lu

TL;DR
This paper introduces a new fair division model where agents have subjective views on whether goods are divisible, and explores fairness guarantees and algorithms within this framework.
Contribution
It proposes a novel subjective divisibility model for fair division and analyzes fairness guarantees, including MMS and envy-freeness relaxations, with new algorithms and existence results.
Findings
Worst-case MMS approximation ratio is at most 2/3 for multiple agents.
A 1/2-MMS allocation can be computed for any number of agents.
Existence of EFXM and non-wasteful allocations for two agents with limited goods.
Abstract
The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermined and uncontroversial agreement on the (in)divisibility of the resources. In this paper, we propose and study a new model for fair division in which agents have their own subjective divisibility over the goods to be allocated. That is, some agents may find a good to be indivisible and get utilities only if they receive the whole good, while others may consider the same good to be divisible and thus can extract utilities according to the fraction of the good they receive. We investigate fairness properties that can be achieved when agents have subjective divisibility. First, we consider the maximin share (MMS) guarantee and show that the worst-case MMS approximation guarantee is at most for …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Economic theories and models
