Sorted Pareto Dominance: An Extension to Pareto Dominance and Its Application in Soft Constraints

摘要: The Pareto dominance relation compares decisions with each other over multiple aspects, and any decision that is not dominated by another called optimal, which a desirable property in making. However, the very discerning, often leads to large number of non-dominated or optimal decisions. By strengthening relation, we can narrow down this nondominated set smaller set, e.g., for presenting more interesting maker. In paper, look at particular Sorted-Pareto dominance, giving some properties characterise semantics context making under uncertainty. We then examine use Soft Constraints setting, explore algorithms generating solutions problems.