Allocating Indivisible Items in Categorized Domains
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 359-364.
Abstract
We initiate a research agenda of mechanism design for categorized domain allocation problems (CDAPs), where indivisible items from multiple categories are allocated to agents without monetary transfer and each agent gets at least one item per category. We focus on basic CDAPs, where each agent gets exactly one item per category. We first characterize serial dictatorships by a minimal set of three axiomatic properties: strategy-proofness, non-bossiness, and category-wise neutrality. Then, we propose a natural extension of serial dictatorships called categorial sequential allocation mechanisms (CSAMs), which allocate the items in multiple rounds: in each round, the designated agent chooses an item from a designated category. We fully characterize the worst-case rank efficiency of CSAMs for optimistic and pessimistic agents.
@inproceedings{ijcai2016p58,
title = {Allocating Indivisible Items in Categorized Domains},
author = {Mackin, Erika and Xia, Lirong},
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 = {359--364},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/58},
}
TY - CPAPER TI - Allocating Indivisible Items in Categorized Domains AU - Mackin, Erika AU - Xia, Lirong 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 - 359 EP - 364 UR - https://ijcai.org/proceedings/2016/58 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
