Assigning a Small Agreeable Set of Indivisible Items to Multiple Players
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 489-494.
Abstract
We consider an assignment problem that has aspects of fair division as well as social choice. In particular, we investigate the problem of assigning a small subset from a set of indivisible items to multiple players so that the chosen subset is agreeable to all players, i.e., every player weakly prefers the chosen subset to any subset of its complement. For an arbitrary number of players, we derive tight upper bounds on the size for which a subset of that size that is agreeable to all players always exists when preferences are monotonic. We then present polynomial-time algorithms that find an agreeable subset of approximately half of the items when there are two or three players and preferences are responsive. Our results translate to a 2-approximation on the individual welfare of every player when preferences are subadditive.
@inproceedings{ijcai2016p76,
title = {Assigning a Small Agreeable Set of Indivisible Items to Multiple Players},
author = {Suksompong, Warut},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {489--494},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/76},
}
TY - CPAPER TI - Assigning a Small Agreeable Set of Indivisible Items to Multiple Players AU - Suksompong, Warut T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 489 EP - 494 UR - https://ijcai.org/proceedings/2016/76 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
