Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
Bouveret, Sylvain; Lang, Jérôme (2008), Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity, The Journal of Artificial Intelligence Research, 32, p. 525-564. http://dx.doi.org/10.1613/jair.2467
TypeArticle accepté pour publication ou publié
Nom de la revueThe Journal of Artificial Intelligence Research
MétadonnéesAfficher la notice complète
Résumé (EN)We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by assuming that agents have dichotomous preferences expressed by propositional formulae. We express efficiency and envy-freeness in a logical setting, which reveals unexpected connections to nonmonotonic reasoning. Then we identify the complexity of determining whether there exists an efficient and envy-free allocation, for several notions of efficiency, when preferences are represented in a succinct way (as well as restrictions of this problem). We first study the problem under the assumption that preferences are dichotomous, and then in the general case.
Mots-clésallocation of resources; Complexity; nonmonotonic reasoning
Affichage des éléments liés par titre et auteur.
Baumeister, Dorothea; Bouveret, Sylvain; Lang, Jérôme; Nguyen, Trung Thanh; Rothe, Jörg; Saffidine, Abdallah (2017) Article accepté pour publication ou publié