Ranking Specific Sets of Objects

Ranking sets of objects based on an order between the single elements has been thoroughly studied in the literature. In particular, it has been shown that it is in general impossible to find a total ranking – jointly satisfying properties as dominance and independence – on the whole power set of objects. However, in many applications certain elements from the entire power set might not be required and can be neglected in the ranking process. For instance, certain sets might be ruled out due to hard constraints or are not satisfying some background theory. In this paper, we treat the computational problem whether an order on a given subset of the power set of elements satisfying different variants of dominance and independence can be found, given a ranking on the elements. We show that this problem is tractable for partial rankings and NP-complete for total rankings.

[1]  Walter Bossert,et al.  Choice under complete uncertainty: axiomatic characterizations of some decision rules , 2000 .

[2]  Salem Benferhat,et al.  Qualitative choice logic , 2004, Artif. Intell..

[3]  Ulrich Endriss,et al.  Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects , 2014, J. Artif. Intell. Res..

[4]  Dennis J. Packard,et al.  Plausibility orderings and social choice , 1981, Synthese.

[5]  Miroslaw Truszczynski,et al.  Strong Equivalence of Qualitative Optimization Problems , 2012, KR.

[6]  Salvador Barberà,et al.  Extending an order on a Set to the power set: Some remarks on Kannai and Peleg's approach , 1984 .

[7]  Rüdiger Dillmann,et al.  Probabilistic decision-making under uncertainty for autonomous driving using continuous POMDPs , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[8]  P. Pattanaik,et al.  An axiomatic characterization of the lexicographic maximin extension of an ordering over a set to the power set , 1984 .

[9]  Sébastien Konieczny,et al.  A Characterization of Optimality Criteria for Decision Making under Complete Ignorance , 2010, KR.

[10]  Miroslaw Truszczynski,et al.  Answer Set Optimization , 2003, IJCAI.

[11]  Walter Bossert,et al.  Revealed preference and choice under uncertainty , 2010 .

[12]  Walter Bossert,et al.  Preference extension rules for ranking sets of alternatives with a fixed cardinality , 1995 .

[13]  B. Peleg,et al.  A note on the extension of an order on a set to the power set , 1984 .

[14]  Jaroslav Opatrny,et al.  Total Ordering Problem , 1979, SIAM J. Comput..

[15]  W. Bossert,et al.  Ranking Sets of Objects , 2001 .

[16]  Peter C. Fishburn,et al.  Comment on the Kannai-Peleg impossibility theorem for extending orders , 1984 .