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...
Үндсэн зохиолчид: | Manurangsi, P, Suksompong, W |
---|---|
Формат: | Journal article |
Хэвлэсэн: |
Elsevier
2018
|
Ижил төстэй зүйлс
-
Computing an approximately optimal agreeable set of items
-н: Manurangsi, P, зэрэг
Хэвлэсэн: (2017) -
The price of fairness for indivisible goods
-н: Bei, X, зэрэг
Хэвлэсэн: (2019) -
Fairly allocating contiguous blocks of indivisible items
-н: Suksompong, W
Хэвлэсэн: (2019) -
Fairly allocating contiguous blocks of indivisible items
-н: Suksompong, W
Хэвлэсэн: (2017) -
Consensus halving for sets of items
-н: Goldberg, PW, зэрэг
Хэвлэсэн: (2022)