Fairly allocating many goods with few queries
We investigate the query complexity of the fair allocation of indivisible goods. For two agents with arbitrary monotonic valuations, we design an algorithm that computes an allocation satisfying envy-freeness up to one good (EF1), a relaxation of envy-freeness, using a logarithmic number of queries....
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
Association for the Advancement of Artificial Intelligence
2019
|