Computing a small agreeable set of indivisible items
We study the problem of assigning a small subset of indivisible items to a group of agents so that the subset is agreeable to all agents, meaning that all agents value the subset as least as much as its complement. For an arbitrary number of agents and items, we derive a tight worst-case bound on th...
Prif Awduron: | Manurangsi, P, Suksompong, W |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
Elsevier
2018
|
Eitemau Tebyg
-
Computing an approximately optimal agreeable set of items
gan: Manurangsi, P, et al.
Cyhoeddwyd: (2017) -
The price of fairness for indivisible goods
gan: Bei, X, et al.
Cyhoeddwyd: (2019) -
Fairly allocating contiguous blocks of indivisible items
gan: Suksompong, W
Cyhoeddwyd: (2019) -
Fairly allocating contiguous blocks of indivisible items
gan: Suksompong, W
Cyhoeddwyd: (2017) -
Consensus halving for sets of items
gan: Goldberg, PW, et al.
Cyhoeddwyd: (2022)