The price of connectivity in fair division
We study the allocation of indivisible goods that form an undirected graph and quantify the loss of fairness when we impose a constraint that each agent must receive a connected subgraph. Our focus is on well-studied fairness notions including envy-freeness and maximin share fairness. We introduc...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2022
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/161276 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|