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...
Main Authors: | Manurangsi, P, Suksompong, W |
---|---|
格式: | Conference item |
出版: |
International Joint Conferences on Artificial Intelligence
2017
|
相似书籍
-
Computing a small agreeable set of indivisible items
由: Manurangsi, P, et al.
出版: (2018) -
Consensus halving for sets of items
由: Goldberg, PW, et al.
出版: (2022) -
«The Multiplicity of Agreeable Consciousness»
由: Freiburg, Rudolf
出版: (2015-06-01) -
Asymptotic existence of fair divisions for groups
由: Manurangsi, P, et al.
出版: (2017) -
When do envy-free allocations exist?
由: Manurangsi, P, et al.
出版: (2019)