Proceedings

New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks

Download BibTeX Cite

Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 62-66.

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.

Sylvain Bouveret, and Michel Lemaître. 2007. New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 62–66. https://ijcai.org/proceedings/2007/8
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards