Constraint satisfaction and fair multi-objective optimization problems: foundations, complexity, and islands of tractability

Authors:
Gianluigi Greco;Francesco Scarcello
Affiliations:
University of Calabria, Italy;University of Calabria, Italy
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 15
Cited 0

Improved relaxation and search methods for approximate constraint satisfaction with a maximin criterion

Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods

Artificial Intelligence
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Constraint Processing

Constraint Processing
The Santa Claus problem

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Weighted hypertree decompositions and optimal query plans

Journal of Computer and System Sciences
Computing leximin-optimal solutions in constraint networks

Artificial Intelligence
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Lexicographically-ordered constraint satisfaction problems

Constraints
Structural tractability of constraint optimization

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

An extension of the CSP optimization framework tailored to identify fair solutions to instances involving multiple optimization functions is studied. Two settings are considered, based on the maximization of the minimum value over all the given functions (MAX-MIN approach) and on its lexicographical refinement where, over all solutions maximizing the minimum value, those maximizing the second minimum value are preferred, and so on, until all functions are considered (LEXMAX-MIN approach). For both settings, the complexity of computing an optimal solution is analyzed and the tractability frontier is charted for acyclic instances, w.r.t. the number and the domains of the functions to be optimized. Larger islands of tractability are then identified via a novel structural approach, based on a notion of guard that is designed to deal with the interactions among constraint scopes and optimization functions.