{'fraction_non_alphanumeric': 0.020765027322404372, 'fraction_numerical': 0.0, 'mean_word_length': 5.026315789473684, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Sorted-Pareto Dominance : an extension to the Pareto Dominance relation and its application in Soft Constraints

The Pareto dominance relation, widely used in a number of decision making areas, can suffer from a lack of discriminatory power, which may result in a large number of undominated or optimal solutions. By strengthening this relation, we can narrow down this optimal set further, which is desirable e.g., for presenting a smaller number of more interesting solutions to a decision maker. This paper looks at a particular strengthening of the Pareto dominance relation, called Sorted-Pareto dominance, giving a semantics for the relation, and explores some possible usages within a Soft Constraints setting for providing a set of optimal solutions to a Soft Constraints problem. We also look at some further possible usages of the relation, with a view to future work and providing some empirical results.