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...
Главные авторы: | Manurangsi, P, Suksompong, W |
---|---|
Формат: | Conference item |
Опубликовано: |
International Joint Conferences on Artificial Intelligence
2017
|
Схожие документы
-
Computing a small agreeable set of indivisible items
по: Manurangsi, P, и др.
Опубликовано: (2018) -
Consensus halving for sets of items
по: Goldberg, PW, и др.
Опубликовано: (2022) -
«The Multiplicity of Agreeable Consciousness»
по: Freiburg, Rudolf
Опубликовано: (2015-06-01) -
Asymptotic existence of fair divisions for groups
по: Manurangsi, P, и др.
Опубликовано: (2017) -
When do envy-free allocations exist?
по: Manurangsi, P, и др.
Опубликовано: (2019)