Almost envy-freeness in group resource allocation
We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. In particular, our results cover cases of arbitr...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
International Joint Conferences on Artificial Intelligence Organization
2019
|