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: | Bei, Xiaohui, Igarashi, Ayumi, Lu, Xinhang, Suksompong, Warut |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161276 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Fair division of mixed divisible and indivisible goods
by: Bei, Xiaohui, et al.
Published: (2022) -
On random assignment problems
by: LIU, Peng
Published: (2017) -
Fair Division with Uncertain Needs
by: Jingyi XUE,
Published: (2017) -
Arithmetical sacks forcing
by: Downey, R., et al.
Published: (2014) -
The interaction of self-esteem and self-efficacy influencing malicious envy
by: Li, Alexadra L., et al.
Published: (2007)