A constraint programming algorithm for finding leximin-optimal allocations

Abstract

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

Rahmatullah Muin

Keywords

Related Articles

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

Assessment of the Quality of the Training System in Moroccan Higher Education Institutions: Case of the Sciences ans Techniques of Physical and Sports Activities

Purpose: The aim of our study is to assess the overall quality of the university training system in sciences and techniques of physical and sports activities in Moroccan higher education. Method: Our method was based on...

A new MPPT technique for optimal and efficient monitoring in case of environmental or load conditions variation

Due to the very high initial investment cost of photovoltaic systems and their low conversion efficiency, it is essential to operate PV generators at the point of maximum power (MPP). Within this framework, our first obj...

A simple formalism Artificial intelligence-based to represent knowledge in a multi-agent planning context

At the start of the simulation, the agent knows nothing about how the dynamics of interaction with the environment unfold, or what causes his sensations. He does not distinguish obstacles from free paths, and he does not...

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 EP694265
  • DOI https://doi.org/10.52502/ijitas.v2i2.11
  • Views 154
  • Downloads 0

How To Cite

Rahmatullah Muin (2020). A constraint programming algorithm for finding leximin-optimal allocations. International Journal of Information Technology and Applied Sciences (IJITAS), 2(2), -. https://europub.co.uk/articles/-A-694265