How to Fairly and Efficiently Assign Tasks in Individually Rational Agents' Coalitions Models and Fairness Measures
Computer Science and Information Systems, Tome 21 (2024) no. 1.

Voir la notice de l'article provenant de la source Computer Science and Information Systems website

An individually rational agent will participate in a multiagent coalition if the participation, given available information and knowledge, brings a payoff that is at least as high as the one achieved by not participating. Since agents' performance and skills may vary from task to task, the decisions about individual agent-task assignment will determine the overall performance of the coalition. Maximising the efficiency of the one-on-one assignment of tasks to agents corresponds to the conventional linear sum assignment problem, which considers efficiency as the sum of the costs or benefits of individual agent-task assignments obtained by the coalition as a whole. This approach may be unfair since it does not explicitly consider fairness and, thus, is unsuitable for individually rational agents' coalitions. In this paper, we propose two new assignment models that balance efficiency and fairness in task assignment and study the utilitarian, egalitarian, and Nash social welfare for task assignment in individually rational agents' coalitions. Since fairness is a relatively abstract term that can be difficult to quantify, we propose three new fairness measures based on equity and equality and use them to compare the newly proposed models. Through functional examples, we show that a reasonable trade-off between efficiency and fairness in task assignment is possible through the use of the proposed models.
Keywords: Task Assignment, Multi-Agent Systems, Fairness, Efficiency, Resource Allocation, Multi-Agent Coordination
@article{CSIS_2024_21_1_a16,
     author = {Marin Lujak and Alessio Salvatore and Alberto Fern\'andez and Stefano Giordani and Kendal Cousy},
     title = {How to {Fairly} and {Efficiently} {Assign} {Tasks} in {Individually} {Rational} {Agents'} {Coalitions} {Models} and {Fairness} {Measures}},
     journal = {Computer Science and Information Systems},
     publisher = {mathdoc},
     volume = {21},
     number = {1},
     year = {2024},
     url = {http://geodesic.mathdoc.fr/item/CSIS_2024_21_1_a16/}
}
TY  - JOUR
AU  - Marin Lujak
AU  - Alessio Salvatore
AU  - Alberto Fernández
AU  - Stefano Giordani
AU  - Kendal Cousy
TI  - How to Fairly and Efficiently Assign Tasks in Individually Rational Agents' Coalitions Models and Fairness Measures
JO  - Computer Science and Information Systems
PY  - 2024
VL  - 21
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CSIS_2024_21_1_a16/
ID  - CSIS_2024_21_1_a16
ER  - 
%0 Journal Article
%A Marin Lujak
%A Alessio Salvatore
%A Alberto Fernández
%A Stefano Giordani
%A Kendal Cousy
%T How to Fairly and Efficiently Assign Tasks in Individually Rational Agents' Coalitions Models and Fairness Measures
%J Computer Science and Information Systems
%D 2024
%V 21
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CSIS_2024_21_1_a16/
%F CSIS_2024_21_1_a16
Marin Lujak; Alessio Salvatore; Alberto Fernández; Stefano Giordani; Kendal Cousy. How to Fairly and Efficiently Assign Tasks in Individually Rational Agents' Coalitions Models and Fairness Measures. Computer Science and Information Systems, Tome 21 (2024) no. 1. http://geodesic.mathdoc.fr/item/CSIS_2024_21_1_a16/