{"type":"ScholarlyArticle","title":"New Constraint Programming Approaches for the Computation of Leximin-Optimal Solutions in Constraint Networks","authors":[{"name":"Sylvain Bouveret","slug":"sylvain-bouveret","given":"Sylvain","family":"Bouveret","affiliation":""},{"name":"Michel Lemaître","slug":"michel-lemaitre","given":"Michel","family":"Lemaître","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2007/8","pdf":"https://ijcai.org/proceedings/2007/0008.pdf","markdown":"https://ijcai.org/proceedings/2007/8.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/8","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":8,"pages":{"first":62,"last":66},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}