Computing an approximately optimal agreeable set of items
We study the problem of finding a small subset of items that is agreeable to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Vydáno: |
International Joint Conferences on Artificial Intelligence
2017
|