New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks
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.
Cite
Text
Bouveret and Lemaître. "New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks." International Joint Conference on Artificial Intelligence, 2007.Markdown
[Bouveret and Lemaître. "New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks." International Joint Conference on Artificial Intelligence, 2007.](https://mlanthology.org/ijcai/2007/bouveret2007ijcai-new/)BibTeX
@inproceedings{bouveret2007ijcai-new,
title = {{New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks}},
author = {Bouveret, Sylvain and Lemaître, Michel},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2007},
pages = {62-67},
url = {https://mlanthology.org/ijcai/2007/bouveret2007ijcai-new/}
}