Author
Listed:
- Atef Gharbi
(Department of Information Systems, Faculty of Computing and Information Technology, Northern Border University, Rafha 91911, Saudi Arabia)
- Mohamed Ayari
(Department of Information Technology, Faculty of Computing and Information Technology, Northern Border University, Rafha 91911, Saudi Arabia)
- Nasser Albalawi
(Department of Computer Sciences, Faculty of Computing and Information Technology, Northern Border University, Rafha 91911, Saudi Arabia)
- Yamen El Touati
(Department of Computer Sciences, Faculty of Computing and Information Technology, Northern Border University, Rafha 91911, Saudi Arabia)
- Zeineb Klai
(Department of Computer Sciences, Faculty of Computing and Information Technology, Northern Border University, Rafha 91911, Saudi Arabia)
Abstract
This study introduces a novel framework for fair resource allocation in self-governing, multi-agent systems, leveraging principles of interactional justice to enable agents to autonomously evaluate fairness in both individual and collective resource distribution. Central to our approach is the integration of Rescher’s canons of distributive justice, which provide a comprehensive, multidimensional framework encompassing equality, need, effort and productivity to assess legitimate claims on resources. In resource-constrained environments, multiagent systems require a balance between fairness and satisfaction. We compare the Borda Count (BC) method with K-means clustering, which group agents by similarity and allocate resources based on cluster averages. According to our findings, the BC method effectively prioritized the highest needs of the agents and resulted in higher satisfaction. On the other hand, K-means achieved higher fairness and facilitated a more equitable distribution of resources. The study showed that there was an intrinsic balance between fairness and satisfaction with the allocation of resources. The BC method is more suitable when individual needs are the main concern, while K-means is better when ensuring an equitable distribution between agents. In this work, we provide a refined understanding of the resource allocation strategies of multi-agent systems and emphasize the strengths and limitations of each approach to help system designers choose the appropriate methods.
Suggested Citation
Atef Gharbi & Mohamed Ayari & Nasser Albalawi & Yamen El Touati & Zeineb Klai, 2025.
"A Comparative Analysis of Fairness and Satisfaction in Multi-Agent Resource Allocation: Integrating Borda Count and K-Means Approaches with Distributive Justice Principles,"
Mathematics, MDPI, vol. 13(15), pages 1-18, July.
Handle:
RePEc:gam:jmathe:v:13:y:2025:i:15:p:2355-:d:1708229
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:15:p:2355-:d:1708229. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.