A Comparative Analysis of Fairness and Satisfaction in Multi-Agent Resource Allocation: Integrating Borda Count and K-Means Approaches with Distributive Justice Principles

Atef Gharbi, Mohamed Ayari (), Nasser Albalawi, Yamen El Touati and Zeineb Klai
Additional contact information
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

Mathematics, 2025, vol. 13, issue 15, 1-18

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.

Keywords: Rescher’s canons; Borda count; resource allocation; multi-agent systems; K-means (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/15/2355/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/15/2355/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:15:p:2355-:d:1708229

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().