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...
Những tác giả chính: | Manurangsi, P, Suksompong, W |
---|---|
Định dạng: | Conference item |
Được phát hành: |
International Joint Conferences on Artificial Intelligence
2017
|
Những quyển sách tương tự
-
Computing a small agreeable set of indivisible items
Bằng: Manurangsi, P, et al.
Được phát hành: (2018) -
Consensus halving for sets of items
Bằng: Goldberg, PW, et al.
Được phát hành: (2022) -
«The Multiplicity of Agreeable Consciousness»
Bằng: Freiburg, Rudolf
Được phát hành: (2015-06-01) -
Asymptotic existence of fair divisions for groups
Bằng: Manurangsi, P, et al.
Được phát hành: (2017) -
When do envy-free allocations exist?
Bằng: Manurangsi, P, et al.
Được phát hành: (2019)