Ordinal dominance with binary interactions for subset choice: axiomatic analysis and complexity issues - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

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

Abstract

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.
Fichier principal
Vignette du fichier
M-pref_2022_paper_2741.pdf (531.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03812006 , version 1 (12-10-2022)

Identifiers

  • HAL Id : hal-03812006 , version 1

Cite

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⟩
39 View
24 Download

Share

Gmail Facebook X LinkedIn More