Fair Division with Subjective Divisibility
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908287662817280 |
|---|---|
| author | Bei, Xiaohui Liu, Shengxin Lu, Xinhang |
| author_facet | Bei, Xiaohui Liu, Shengxin Lu, Xinhang |
| contents | 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 $2/3$ for $n \geq 2$ agents and this ratio is tight in the two- and three-agent cases. This is in contrast to the classic fair division settings involving two or three agents. We also give an algorithm that produces a $1/2$-MMS allocation for an arbitrary number of agents. Second, we study a hierarchy of envy-freeness relaxations, including EF1M, EFM and EFXM, ordered by increasing strength. While EF1M is compatible with non-wastefulness (an economic efficiency notion), this is not the case for EFM, even for two agents. Nevertheless, an EFXM and non-wasteful allocation always exists for two agents if at most one good is discarded. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_00976 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Fair Division with Subjective Divisibility Bei, Xiaohui Liu, Shengxin Lu, Xinhang Computer Science and Game Theory 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 $2/3$ for $n \geq 2$ agents and this ratio is tight in the two- and three-agent cases. This is in contrast to the classic fair division settings involving two or three agents. We also give an algorithm that produces a $1/2$-MMS allocation for an arbitrary number of agents. Second, we study a hierarchy of envy-freeness relaxations, including EF1M, EFM and EFXM, ordered by increasing strength. While EF1M is compatible with non-wastefulness (an economic efficiency notion), this is not the case for EFM, even for two agents. Nevertheless, an EFXM and non-wasteful allocation always exists for two agents if at most one good is discarded. |
| title | Fair Division with Subjective Divisibility |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2310.00976 |