Computing a small agreeable set of indivisible items
We study the problem of assigning a small subset of indivisible items to a group of agents so that the subset is agreeable to all agents, meaning that all agents value the subset as least as much as its complement. For an arbitrary number of agents and items, we derive a tight worst-case bound on th...
| Hlavní autoři: | , |
|---|---|
| Médium: | Journal article |
| Vydáno: |
Elsevier
2018
|