Allocating indivisible items with minimum dissatisfaction on preference graphs

[HTML] sciencedirect.com

[HTML][HTML] Allocation of indivisible items with individual preference graphs

N Chiarelli, C Dallard, A Darmann, S Lendl… - Discrete Applied …, 2023 - Elsevier
This paper studies the allocation of indivisible items to agents, when each agent's
preferences are expressed by means of a directed acyclic graph. The vertices of each …
被引用次数：2 相关文章 所有 4 个版本
[PDF] arxiv.org

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction

N Chiarelli, C Dallard, A Darmann, S Lendl… - arXiv preprint arXiv …, 2024 - arxiv.org
Allocating indivisible items among a set of agents is a frequently studied discrete
optimization problem. In the setting considered in this work, the agents' preferences over the …
相关文章 所有 2 个版本
[PDF] arxiv.org

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph

N Chiarelli, C Dallard, A Darmann, S Lendl… - arXiv preprint arXiv …, 2023 - arxiv.org
We consider the task of allocating indivisible items to agents, when the agents' preferences
over the items are identical. The preferences are captured by means of a directed acyclic …
相关文章 所有 2 个版本