On Interim Envy-Free Allocation Lotteries
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909404373188608 |
|---|---|
| author | Caragiannis, Ioannis Kanellopoulos, Panagiotis Kyropoulou, Maria |
| author_facet | Caragiannis, Ioannis Kanellopoulos, Panagiotis Kyropoulou, Maria |
| contents | With very few exceptions, recent research in fair division has mostly focused on deterministic allocations. Deviating from this trend, we study the fairness notion of interim envy-freeness (iEF) for lotteries over allocations, which serves as a sweet spot between the too stringent notion of ex-post envy-freeness and the very weak notion of ex-ante envy-freeness. Our analysis relates iEF to other fairness notions as well, and reveals tradeoffs between iEF and efficiency. Even though several of our results apply to general fair division problems, we are particularly interested in instances with equal numbers of agents and items where allocations are perfect matchings of the items to the agents. We show how to compute iEF allocations in matching allocation instances in polynomial time, while also maximizing several efficiency objectives, even though this proves to be considerably more challenging than computing envy-free allocations. Our algorithms use efficient solutions to a novel variant of the bipartite matching problem. We also study the extension of iEF when payments to or from the agents are allowed. We present a series of results on two optimization problems, including a generalization of the classical rent division problem to random allocations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2102_07839 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | On Interim Envy-Free Allocation Lotteries Caragiannis, Ioannis Kanellopoulos, Panagiotis Kyropoulou, Maria Computer Science and Game Theory Data Structures and Algorithms With very few exceptions, recent research in fair division has mostly focused on deterministic allocations. Deviating from this trend, we study the fairness notion of interim envy-freeness (iEF) for lotteries over allocations, which serves as a sweet spot between the too stringent notion of ex-post envy-freeness and the very weak notion of ex-ante envy-freeness. Our analysis relates iEF to other fairness notions as well, and reveals tradeoffs between iEF and efficiency. Even though several of our results apply to general fair division problems, we are particularly interested in instances with equal numbers of agents and items where allocations are perfect matchings of the items to the agents. We show how to compute iEF allocations in matching allocation instances in polynomial time, while also maximizing several efficiency objectives, even though this proves to be considerably more challenging than computing envy-free allocations. Our algorithms use efficient solutions to a novel variant of the bipartite matching problem. We also study the extension of iEF when payments to or from the agents are allowed. We present a series of results on two optimization problems, including a generalization of the classical rent division problem to random allocations. |
| title | On Interim Envy-Free Allocation Lotteries |
| topic | Computer Science and Game Theory Data Structures and Algorithms |
| url | https://arxiv.org/abs/2102.07839 |