Sorted-pareto dominance: an extension to pareto dominance and its application in soft constraints
Loading...
Files
Accepted Version
Date
2012-11-07
Authors
O'Mahony, Conor
Wilson, Nic
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Published Version
Abstract
The Pareto dominance relation compares decisions
with each other over multiple aspects, and any decision that
is not dominated by another is called Pareto optimal, which is
a desirable property in decision making. However, the Pareto
dominance relation is not very discerning, and often leads to
a large number of non-dominated or Pareto optimal decisions.
By strengthening the relation, we can narrow down this nondominated
set of decisions to a smaller set, e.g., for presenting
a smaller number of more interesting decisions to a decision
maker. In this paper, we look at a particular strengthening of the
Pareto dominance called Sorted-Pareto dominance, giving some
properties that characterise the relation, and giving a semantics
in the context of decision making under uncertainty. We then
examine the use of the relation in a Soft Constraints setting, and
explore some algorithms for generating Sorted-Pareto optimal
solutions to Soft Constraints problems.
Description
Keywords
Soft constraints , Partial orders , Pareto dominance
Citation
O'Mahony C., Wilson, N. (2012) Sorted-Pareto Dominance: an extension to Pareto Dominance and its application in Soft Constraints. 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). Athens, Greece, 7-9 November 2012.
Link to publisher’s version
Copyright
© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.