On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Probabilistic Expert Systems
Introduction to Bayesian Networks
Introduction to Bayesian Networks
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
An efficient algorithm for finding the M most probable configurationsin probabilistic expert systems
Statistics and Computing
Combining convergence and diversity in evolutionary multiobjective optimization
Evolutionary Computation
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Compact value-function representations for qualitative preferences
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Journal of the ACM (JACM)
Bucket elimination for multiobjective optimization problems
Journal of Heuristics
A Soft Approach to Multi-objective Optimization
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Search for Compromise Solutions in Multiobjective State Space Graphs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Near Admissible Algorithms for Multiobjective Search
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Local Computation Schemes with Partially Ordered Preferences
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Multi-objective Russian Doll search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Preference aggregation with graphical utility models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A new approach to multiobjective A* search
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
UCP-networks: a directed graphical representation of conditional utilities
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Graphical models for preference and utility
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Hi-index | 0.03 |
This paper deals with preference representation on combinatorial domains and preference-based recommendation in the context of multicriteria or multiagent decision making. The alternatives of the decision problem are seen as elements of a product set of attributes and preferences over solutions are represented by generalized additive decomposable (GAI) utility functions modeling individual preferences or criteria. Thanks to decomposability, utility vectors attached to solutions can be compiled into a graphical structure closely related to junction trees, the so-called GAI network. Using this structure, we present preference-based search algorithms for multicriteria or multiagent decision making. Although such models are often non-decomposable over attributes, we actually show that GAI networks are still useful to determine the most preferred alternatives provided preferences are compatible with Pareto dominance. We first present two algorithms for the determination of Pareto-optimal elements. Then the second of these algorithms is adapted so as to directly focus on the preferred solutions. We also provide results of numerical tests showing the practical efficiency of our procedures in various contexts such as compromise search and fair optimization in multicriteria or multiagent problems.