Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Refinements of the maximin approach to decision-making in a fuzzy environment
Fuzzy Sets and Systems - Special issue on fuzzy optimization
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Computing leximin-optimal solutions in constraint networks
Artificial Intelligence
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Interval-valued soft constraint problems
Annals of Mathematics and Artificial Intelligence
Graphical models for preference and utility
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Sorted Pareto Dominance: An Extension to Pareto Dominance and Its Application in Soft Constraints
ICTAI '12 Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence - Volume 01
Hi-index | 0.00 |
Pareto dominance is often used in decision making to compare decisions that have multiple preference values --- however it can produce an unmanageably large number of Pareto optimal decisions. When preference value scales can be made commensurate, then the Sorted-Pareto relation produces a smaller, more manageable set of decisions that are still Pareto optimal. Sorted-Pareto relies only on qualitative or ordinal preference information, which can be easier to obtain than quantitative information. This leads to a partial order on the decisions, and in such partially-ordered settings, there can be many different natural notions of optimality. In this paper, we look at these natural notions of optimality, applied to the Sorted-Pareto and min-sum of weights case; the Sorted-Pareto ordering has a semantics in decision making under uncertainty, being consistent with any possible order-preserving function that maps an ordinal scale to a numerical one. We show that these optimality classes and the relationships between them provide a meaningful way to categorise optimal decisions for presenting to a decision maker.