Ordinal dominance with binary interactions for subset choice: axiomatic analysis and complexity issues

Ariane Ravier (1) , Hugo Gilbert (1) , Meltem Öztürk (1) , Olivier Spanjaard (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 DECISION

The article focuses on a subset comparison model introduced by Fishburn and LaValle [1996], called ordinal dominance (with binary interactions). After giving an axiomatic analysis pointing out several differences between the studied model and one without interactions, we investigate the problem of determining non-dominated subsets from an algorithmic point of view, with a complexity result (determining if a given subset is non-dominated is co-NP-complete), and present an algorithm to determine a non-dominated subset in polynomial time.

Domaines: Informatique [cs]; Intelligence artificielle [cs.AI]; Complexité [cs.CC]

Ariane Ravier, Hugo Gilbert, Meltem Öztürk, Olivier Spanjaard. Ordinal dominance with binary interactions for subset choice: axiomatic analysis and complexity issues. M-pref 2022: 13th Multidisciplinary Workshop on Advances in Preference Handling, Jul 2022, Vienna, Austria. ⟨hal-03812006⟩