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
|
Ижил төстэй зүйлс
Improved Approximation Algorithms for Projection Games
-н: Manurangsi, Pasin, зэрэг
Хэвлэсэн: (2017)
-н: Manurangsi, Pasin, зэрэг
Хэвлэсэн: (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)