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 nucleolus of a matrix game and other nucleoli
Mathematics of Operations Research
The general nucleolus and the reduced game property
International Journal of Game Theory
The OPL optimization programming language
The OPL optimization programming language
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Introduction to Algorithms
Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family
Proceedings of the 17th International Conference on Logic Programming
Exploiting a Common Property Resource under a Fairness Constraint: a Case Study
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
On Equitable Resource Allocation Problems: a Lexicographic Minimax Approach
Operations Research
Constraint Processing
Combinatorial Auctions
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Filtering algorithms for the multiset ordering constraint
Artificial Intelligence
SLIDE: A Useful Special Case of the CARDPATH Constraint
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Filtering algorithms for the multiset ordering constraint
Artificial Intelligence
On Principles of Fair Resource Allocation for Importance Weighted Agents
SOCINFO '09 Proceedings of the 2009 International Workshop on Social Informatics
Bicriteria models for fair and efficient resource allocation
SocInfo'10 Proceedings of the Second international conference on Social informatics
Sorted-Pareto dominance and qualitative notions of optimality
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In many real-world multiobjective optimization problems one needs to find solutions or alternatives that provide a fair compromise between different conflicting objective functions-which could be criteria in a multicriteria context, or agent utilities in a multiagent context-while being efficient (i.e. informally, ensuring the greatest possible overall agents' satisfaction). This is typically the case in problems implying human agents, where fairness and efficiency requirements must be met. Preference handling, resource allocation problems are another examples of the need for balanced compromises between several conflicting objectives. A way to characterize good solutions in such problems is to use the leximin preorder to compare the vectors of objective values, and to select the solutions which maximize this preorder. In this article, we describe five algorithms for finding leximin-optimal solutions using constraint programming. Three of these algorithms are original. Other ones are adapted, in constraint programming settings, from existing works. The algorithms are compared experimentally on three benchmark problems.