An algorithm to calculates an allocation maximizing the leximin order on the utility profiles of the agents

Abstract

Allocating a limited set of resources equitably and efficiently to agents each with their own preferences is a general problem of considerable significance. Many examples of this problem are commonly found, among which we can cite the construction of schedules, the sharing of communication networks, the management of airport resources involving several companies, the sharing of airspace between different users, sharing of satellite resources. In the context of constraint programming, we propose an algorithm solving the following problem: allocate in an equitable and efficient way a finite set of objects to agents each having their own utilities, under admissibility constraints. The algorithm calculates an allocation maximizing the leximin order on the utility profiles of the agents. We also describe the field of application that motivated this work: the sharing of satellite resources. We extract from it a simple and precise problem of fair allocation, which serves as a basis, thanks to a generator of test sets, for the evaluation of the proposed algorithm. Two implementations of the algorithm are compared, one in "pure" constraint programming, with Choco, the other in mixed linear programming with Cplex.

Authors and Affiliations

Sylvain Bouveret Michel Lemaître

Keywords

Related Articles

Sport and Physical Education at Abdelmalek Essaâdi University: State of the Art

This research deals with the issue of Physical Education (PE) and Sport at Abdelmalek Essaâdi University, Tetouan, Morrocco. It adopts a problem related to the diagnosis and development of the Physical Education/sport sy...

Effect of service quality on student-inspector satisfaction at the training center for educational inspectors in Rabat, Morocco

In theory, we all know that if students are satisfied, then training centers do provide a better quality of service. But what about in practice? The purpose of this research is twofold. On the one hand, we aim to assess...

Machine Learning confronted with the operational constraints of detection systems

Intrusion detection systems, traditionally based on signatures, have not escaped the recent appeal of machine learning techniques. While the results presented in academic research articles are often excellent, security e...

An algorithm to calculates an allocation maximizing the leximin order on the utility profiles of the agents

Allocating a limited set of resources equitably and efficiently to agents each with their own preferences is a general problem of considerable significance. Many examples of this problem are commonly found, among which w...

Strategic Information Systems and Artificial Intelligence in Business

Information systems are defined as systems that consist of a group of people, data records, and some manual and non-manual operations. These systems generally handle data and information related to each system, and it ca...

Download PDF file
  • EP ID EP694267
  • DOI https://doi.org/10.52502/ijitas.v2i4.13
  • Views 156
  • Downloads 0

How To Cite

Sylvain Bouveret Michel Lemaître (2020). An algorithm to calculates an allocation maximizing the leximin order on the utility profiles of the agents. International Journal of Information Technology and Applied Sciences (IJITAS), 2(4), -. https://europub.co.uk/articles/-A-694267