Abstract

Decision makers can often be confronted with the need to select a subset of objects from a set of candidate objects by just counting on preferences regarding the objects’ features. Here we formalise this problem as the dominant set selection problem. Solving this problem amounts to finding the preferences over all possible sets of objects. We accomplish so by: (i) grounding the preferences over features to preferences over the objects themselves; and (ii) lifting these preferences to preferences over all possible sets of objects. This is achieved by combining lex-cel –a method from the literature—with our novel anti-lex-cel method, which we formally (and thoroughly) study. Furthermore, we provide a binary integer program encoding to solve the problem. Finally, we illustrate our overall approach by applying it to the selection of value-aligned norm systems.

Highlights

  • Some actual-world decision making problems require to select an array of elements despite decision makers only counting on preferences over the elements’ features

  • We assume that there is a set of candidate norms N and we aim to find the set of norms that better aligns with the moral values of the society

  • Several social ranking solutions have been proposed, such as: a grounding function based on the ceteris paribus majority principle [11]; a grounding function based on the notion of marginal contribution [12]; two rankings based on the analysis of majority graphs and minmax score [1]; or the lex-cel ranking function [6], which is based on lexicographical preferences

Read more

Summary

Introduction

Some actual-world decision making problems require to select an array of elements despite decision makers only counting on preferences over the elements’ features. Some examples are committee selection [13], or college admissions [9, 17]. Considering this last example, picture the following situation. The head master leverages on the admission policy of the school, which, for instance, prioritises some minorities, or fosters impoverished neighbourhoods. Such policies can be cast as preferences over the students’ features. The head master lacks of a straightforward manner to rank all possible sets of students, since these features somehow pose a multi-criteria problem. There is a further dimension of complexity: some sets may not be eligible

42 Page 2 of 38
42 Page 4 of 38
Problem motivation: value‐aligned norm selection
Background
Formalising the dominant set selection problem
42 Page 6 of 38
42 Page 8 of 38
Solving the dominant set selection problem: an outline
The lex‐cel ranking grounding function
42 Page 10 of 38
The anti‐lex‐cel ranking lifting function
42 Page 12 of 38
Formal definition
Axiomatic characterisation
42 Page 14 of 38
On the relation between lex‐cel and anti‐lex‐cel
42 Page 16 of 38
Related results from the literature
Solving the dominant set selection problem
42 Page 18 of 38
42 Page 20 of 38
Application: value‐aligned norm selection
42 Page 22 of 38
42 Page 24 of 38
10 Conclusions and future work
42 Page 26 of 38
42 Page 30 of 38
42 Page 32 of 38
42 Page 34 of 38
42 Page 36 of 38
42 Page 38 of 38
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.