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

Impact of Industrial Atmospheric Emissions on Ambient Air Quality in Arzew Area, Oran State, Algeria

This work focuses on identifying the source of BTEX (Benzene, Toluene, Ethylbenzene, Xylene) emissions generated by hydrocarbon-related industrial activities and evaluation of its impact on ambient air quality according...

Object detection and object classification using machine learning Algorithms

Urban objects are characterized by a very variable representation in terms of shape, texture and color. In addition, they are present multiple times on the images to be analyzed and can be stuck to each other. To carry o...

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...

Exam preparation strategies and concerns of university students: gender and open access vs regulated system effects

The purpose of this study is to identify test preparation strategies and concerns of university students in the open and regulated education system. We surveyed 294 students (55.10% male, 44.90% female), 60.54% from the...

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...

Download PDF file
  • EP ID EP694267
  • DOI https://doi.org/10.52502/ijitas.v2i4.13
  • Views 203
  • 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