Computing leximin-optimal solutions in constraint networks

Artificial Intelligence

Volumn 173, Issue 2, 2009, Pages 343-364

  Bouveret, Sylvain ^a   Lemaître, Michel ^a  

^a ONERA   (France)

Author keywords

Constraint programming; Fairness; Leximin; Multiobjective optimization

Indexed keywords

AGENTS; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; OPTIMAL SYSTEMS; OPTIMIZATION; PLANNING; RESOURCE ALLOCATION;

BENCHMARK PROBLEMS; CONSTRAINT NETWORKS; CONSTRAINT PROGRAMMING; EFFICIENCY REQUIREMENTS; FAIRNESS; HUMAN AGENTS; LEXIMIN; MULTI AGENTS; MULTICRITERIA; MULTIOBJECTIVE OPTIMIZATION PROBLEMS; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; RESOURCE ALLOCATION PROBLEMS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 57749096867     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.10.010     Document Type: Article

References (50)

1. Ball M., Donohue G.L., and Hoffman K. Auctions for the safe, efficient and equitable allocation of airspace system resources. In: Cramton P., Shoham Y., and Steinberg R. (Eds). Combinatorial Auctions (2006), MIT Press 507-538 (Chapter 22)
2. N. Beldiceanu, M. Carlsson, Revisiting the cardinality operator and introducing cardinality-path constraint family, in: Proceedings of the 17th International Conference on Logic Programming (ICLP-01), Paphos, Cyprus, 2001
3. Bessière C. Constraint propagation. In: Rossi F., van Beck P., and Walsh T. (Eds). Handbook of Constraint Programming, Foundations of Artificial Intelligence (2006), Elsevier 29-83 (Chapter 3)
4. C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, T. Walsh, SLIDE: A useful special case of the CARDPATH Constraint, in: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-08), Patras, Greece, 2008
5. Bleuzen-Guernalec N., and Colmerauer A. Narrowing a block of sortings in quadratic time. In: Smolka G. (Ed). Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97). Schloss Hagenberg, Austria (1997), Springer
6. Bouveret S., Fargier H., Lang J., and Lemaître M. Allocation of indivisible goods: a general model and some complexity results. In: Dignum F., Dignum V., Koenig S., Kraus S., Singh M.P., and Wooldridge M. (Eds). Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-05). Utrecht, The Netherlands (2005), ACM
7. Bouveret S., and Lemaître M. New constraint programming approaches for the computation of leximin-optimal solutions in constraint networks. In: Veloso M.M. (Ed). Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07). Hyderabad, India (2007), AAAI Press
8. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press
9. In: Cramton P., Shoham Y., and Steinberg R. (Eds). Combinatorial Auctions (2006), MIT Press
10. d'Aspremont C., and Gevers L. Equity and the informational basis of collective choice. Review of Economic Studies 44 2 (1977) 199-209
11. Dechter R. Constraint Processing (2003), Morgan Kaufmann
12. Dubois D., and Fortemps P. Computing improved optimal solutions to max-min flexible constraint satisfaction problems. European Journal of Operational Research 118 (1999) 95-126
13. Ehrgott M. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems vol. 491 (2000), Springer
14. H. Fargier, J. Lang, T. Schiex, Selecting preferred solutions in fuzzy constraint satisfaction problems, in: Proceedings of the First European Congress on Fuzzy Intelligent Technologies (EUFIT'93), Aachen, 1993
15. Frisch A.M., Hnich B., Kiziltan Z., Miguel I., and Walsh T. Filtering algorithms for the multiset ordering constraint. Artificial Intelligence 173 2 (2009) 299-328 this issue
16. Frühwirth T., Michel L., and Schulte C. Constraints in procedural and concurrent languages. In: Rossi F., van Beck P., and Walsh T. (Eds). Handbook of Constraint Programming, Foundations of Artificial Intelligence (2006), Elsevier 453-494 (Chapter 13)
17. Garfinkel R.S., and Nemhauser G.L. Integer Programming (1972), Wiley
18. Katriel I., and Thiel S. Fast bound consistency for the global cardinality constraint. In: Rossi F. (Ed). Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP-03). Kinsale, County Cork, Ireland (2003), Springer
19. Keeney R.L., and Raiffa H. Decisions with Multiple Objectives: Preferences and Value Tradeoffs (1976), John Wiley and Sons
20. Z. Kiziltan, Symmetry breaking ordering constraints, Ph.D. thesis, Uppsala University, 2004
21. Knuth D.E. The Art of Computer Programming, vol. 1, Fundamental Algorithms (1968), Addison-Wesley
22. Kolm S.-C. Justice et Équité (1972), Cepremap, CNRS Paris English translation:
23. Kolm S.-C. Justice et Équité. Justice and Equity (1998), MIT Press
24. Laburthe F. CHOCO: Implementing a CP kernel. in: Proceedings of TRICS'2000, Workshop on Techniques for Implementing CP Systems, Singapore, 2000. http://sourceforge.net/projects/choco
25. Lemaître M., Verfaillie G., and Bataille N. Exploiting a common property resource under a fairness constraint: a case study. In: Dean T. (Ed). Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99). Stockholm, Sweden (1999), Morgan Kaufmann
26. Lemaître M., Verfaillie G., Jouhaud F., Lachiver J.-M., and Bataille N. Selecting and scheduling observations of agile satellites. Aerospace Science and Technology 6 (2002) 367-381
27. Leyton-Brown K., Pearson M., and Shoham Y. Towards a universal test suite for combinatorial auction algorithms. Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00). Minneapolis, MN (2000), ACM
28. Luss H. On equitable resource allocation problems: a lexicographic minimax approach. Operations Research 47 3 (1999) 361-378
29. J.-L. Marichal, Aggregation operators for multicriteria decision aid, Ph.D. thesis, Faculté des Sciences de l'Université de Liège, 1999
30. Maschler M., Potters J.A.M., and Tijs S.H. The general nucleolus and the reduced game property. International Journal of Game Theory 21 (1992) 85-106
31. Mehlhorn K., and Thiel S. Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: Dechter R. (Ed). Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP-00). Singapore (2000), Springer
32. Montanari U. Network of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7 (1974) 95-132
33. Moulin H. Axioms of Cooperative Decision Making (1988), Cambridge University Press
34. Moulin H. Fair Division and Collective Welfare (2003), MIT Press
35. Ogryczak W. On the lexicographic minimax approach to location problems. European Journal of Operational Research 100 (1997) 566-585
36. Ogryczak W., and Śliwiński T. On solving linear programs with the ordered weighted averaging objective. European Journal of Operational Research 148 (2003) 80-91
37. Pesant G., and Régin J.-C. sPREAd: A balancing constraint based on statistics. In: van Beek P. (Ed). Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP-04). Sitges, Spain (2005), Springer
38. Potters J.A.M., and Tijs S.H. The nucleolus of a matrix game and other nucleoli. Mathematics of Operations Research 17 (1992) 164-174
39. Quimper C.-G., Golynski A., López-Ortiz A., and van Beek P. An efficient bounds consistency algorithm for the global cardinality constraint. Constraints 10 2 (2005) 115-135
40. In: Rossi F., van Beck P., and Walsh T. (Eds). Handbook of Constraint Programming, Foundations of Artificial Intelligence (2006), Elsevier
41. Sandholm T.W. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 134 (2002) 1-54
42. Sen A.K. Collective Choice and Social Welfare (1970), North-Holland
43. van Beek P. Backtracking search algorithms. In: Rossi F., van Beck P., and Walsh T. (Eds). Handbook of Constraint Programming, Foundations of Artificial Intelligence (2006), Elsevier 85-134 (Chapter 4)
44. Van Hentenryck P. The OPL Optimization Programming Language (1999), The MIT Press
45. Van Hentenryck P., Simonis H., and Dincbas M. Constraint satisfaction using constraint logic programming. Artificial Intelligence 58 1-3 (1992) 113-159
46. van Hoeve W.-J., and Katriel I. Global Constraints. In: Rossi F., van Beck P., and Walsh T. (Eds). Handbook of Constraint Programming, Foundations of Artificial Intelligence (2006), Elsevier 169-208 (Chapter 6)
47. Yager R.R. On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Transactions on Systems, Man, and Cybernetics 18 (1988) 183-190
48. Yager R.R. On the analytic representation of the leximin ordering and its application to flexible constraint propagation. European Journal of Operational Research 102 1 (1997) 176-192
49. Young H.P. Equity in Theory and Practice (1994), Princeton University Press
50. Zhou J. A permutation-based approach for solving the job-shop problem. Constraints 2 2 (1997) 185-213