Weighted Envy-free Allocation with Subsidy
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913549791526912 |
|---|---|
| author | Aziz, Haris Huang, Xin Kimura, Kei Saha, Indrajit Sun, Zhaohong Suzuki, Mashbat Yokoo, Makoto |
| author_facet | Aziz, Haris Huang, Xin Kimura, Kei Saha, Indrajit Sun, Zhaohong Suzuki, Mashbat Yokoo, Makoto |
| contents | We consider the problem of fair allocation of indivisible items with subsidies when agents have weighted entitlements. After highlighting several important differences from the unweighted case, we present several results concerning weighted envy-freeability including general characterizations, algorithms for achieving and testing weighted envy-freeability, lower and upper bounds of the amount of subsidies for envy-freeable allocations, and algorithms for achieving weighted envy-freeability along with other properties. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_08711 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Weighted Envy-free Allocation with Subsidy Aziz, Haris Huang, Xin Kimura, Kei Saha, Indrajit Sun, Zhaohong Suzuki, Mashbat Yokoo, Makoto Computer Science and Game Theory We consider the problem of fair allocation of indivisible items with subsidies when agents have weighted entitlements. After highlighting several important differences from the unweighted case, we present several results concerning weighted envy-freeability including general characterizations, algorithms for achieving and testing weighted envy-freeability, lower and upper bounds of the amount of subsidies for envy-freeable allocations, and algorithms for achieving weighted envy-freeability along with other properties. |
| title | Weighted Envy-free Allocation with Subsidy |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2408.08711 |