Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This material is based upon works supported by the Science Foundation Ireland under Grant No. 08/PI/I1912.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arrow, K.J., Hurwicz, L.: An Optimality Criterion for Decision Making under Ignorance. Basil Blackwell, Oxford (1972)
Bacchus, F., Grove, A.J.: Graphical models for preference and utility. In: Proc. UAI 1995, pp. 3–10 (1995)
Berkelaar, M., Eikland, K., Notebaert, P.: lp_solve, Open source (Mixed-Integer) Linear Programming system. Software (May 1, 2004), http://lpsolve.sourceforge.net/5.5/
Bossong, U., Schweigert, D.: Minimal paths on ordered graphs. Mathematica Slovaca 56, 23–31 (2006)
Bouveret, S., Lemaître, M.: Computing leximin-optimal solutions in constraint networks. Artif. Intell. 173(2), 343–364 (2009)
Dubois, D., Fargier, H., Prade, H.: Refinements of the maximin approach to decision-making in a fuzzy environment. Fuzzy Sets and Systems 81, 103–122 (1996)
Ehrgott, M.: A characterization of lexicographic max-ordering solutions. Technical report, University of Kaiserslautern, Department of Mathematics (1996)
Gavanelli, M.: An implementation of Pareto optimality in CLP(FD). In: CP-AI-OR - International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (2002)
Gelain, M., Pini, M.S., Rossi, F., Brent Venable, K., Wilson, N.: Interval-valued soft constraint problems. Annals of Mathematics and Artificial Intelligence 58, 261–298 (2010)
Kaci, S., Prade, H.: Mastering the processing of preferences by using symbolic priorities in possibilistic logic. In: Proc. ECAI 2008, pp. 376–380 (2008)
Larichev, O.I., Moshkovich, H.M.: ZAPROS-LM – a method and system for ordering multiattribute alternatives. EJOR 82(3), 503–521 (1995)
Moshkovich, H.M., Mechitov, A.I., Olson, D.L.: Ordinal judgments in multiattribute decision analysis. EJOR 137(3), 625–641 (2002)
O’Mahony, C., Wilson, N.: Sorted-Pareto Dominance: an extension to Pareto Dominance and its application in Soft Constraints. In: Proc. ICTAI 2012 (2012)
O’Mahony, C., Wilson, N.: Sorted-Pareto Dominance and qualitative notions of optimality (extended version). Technical report, Cork Constraint Computation Centre (4C), University College Cork (2013), http://4c.ucc.ie/~comahony/docs/sorted_pareto_QNOO_extended.pdf
Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Fran. (1988)
Perny, P., Spanjaard, O.: A preference-based approach to spanning trees and shortest paths problems. EJOR 162, 584–601 (2005)
Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier Science Inc., New York (2006)
Sen, A.K.: Collective choice and social welfare. North-Holland Publishing Co., Amsterdam (1970)
Shorrocks, A.F.: Ranking income distributions. Economica 50(197), 3–17 (1983)
Torrens, M., Faltings, B.: Using soft CSPs for approximating Pareto-optimal solution sets. In: Proc. AAAI 2002 Workshop: Preferences in AI and CP: Symbolic Approaches (2002)
Wilson, N., O’Mahony, C.: The relationships between qualitative notions of optimality for decision making under logical uncertainty. In: Proc. 22nd Irish Conference on Artificial Intelligence and Cognitive Science, AICS 2011 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Mahony, C., Wilson, N. (2013). Sorted-Pareto Dominance and Qualitative Notions of Optimality. In: van der Gaag, L.C. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2013. Lecture Notes in Computer Science(), vol 7958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39091-3_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-39091-3_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39090-6
Online ISBN: 978-3-642-39091-3
eBook Packages: Computer ScienceComputer Science (R0)