Fair allocation in graphs
We study <i>envy freeness up to any good (EFX)</i> in settings where valuations can be represented via a graph of arbitrary size where vertices correspond to agents and edges to items. An item (edge) has zero marginal value to all agents (vertices) not incident to the edge. Each vertex m...
| Main Authors: | , , , |
|---|---|
| פורמט: | Conference item |
| שפה: | English |
| יצא לאור: |
Association for Computing Machinery
2023
|
| נושאים: |