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

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

The mechanism of influence of neurotechnologies on the formation of the sixth technological order in the economy and society

the subject of this work is the study of the mechanism of the effect of "neurotech" technologies on the formation of the sixth technological order in engineering; the object of the article is dedicated to the sixth techn...

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

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

A constraint programming algorithm for finding leximin-optimal allocations

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

Download PDF file
  • EP ID EP694265
  • DOI https://doi.org/10.52502/ijitas.v2i2.11
  • Views 196
  • 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