New constraint programming approaches for the computation of leximin-optimal solutions in constraint networks

Authors:
Sylvain Bouveret;Michel Lemaître
Affiliations:
Office National d'Études et de Recherches Aérospatiales;Office National d'Études et de Recherches Aérospatiales
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 6
Cited 2

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Constraint satisfaction using constraint logic programming

Artificial Intelligence - Special volume on constraint-based reasoning
The OPL optimization programming language

The OPL optimization programming language
Exploiting a Common Property Resource under a Fairness Constraint: a Case Study

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Multicriteria Optimization

Multicriteria Optimization
Multiset ordering constraints

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Computing leximin-optimal solutions in constraint networks

Artificial Intelligence
Risk management for multi-agent resource allocation under incomplete information

International Journal of Systems, Control and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of computing a leximin-optimal solution of a constraint network. This problem is highly motivated by fairness and efficiency requirements in many real-world applications implying human agents. We compare several generic algorithms which solve this problem in a constraint programming framework. The first one is entirely original, and the other ones are partially based on existing works adapted to fit with this problem.