Lifting a preference order on elements of some universe to a preference order on subsets of this universe is often guided by postulated properties the lifted order should have. Well-known impossibility results pose severe limits on when such liftings exist if all non-empty subsets of the universe are to be ordered. The extent to which these negative results carry over to other families of sets is not known. In this paper, we consider families of sets that induce connected subgraphs in graphs. For such families, common in applications, we study whether lifted orders satisfying the well-studied axioms of dominance and (strict) independence exist for every or, in another setting, only for some underlying order on elements (strong and weak orderability). We characterize families that are strongly and weakly orderable under dominance and strict independence, and obtain a tight bound on the class of families that are strongly orderable under dominance and independence.
|Title of host publication||Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018|
|Number of pages||7|
|State||Published - 2018|
|Event||27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, Sweden|
Duration: Jul 13 2018 → Jul 19 2018
|Name||IJCAI International Joint Conference on Artificial Intelligence|
|Conference||27th International Joint Conference on Artificial Intelligence, IJCAI 2018|
|Period||7/13/18 → 7/19/18|
Bibliographical noteFunding Information:
This work was funded by the Austrian Science Fund (FWF) under grant number Y698 and by the NSF under grant number IIS-1618783.
© 2018 International Joint Conferences on Artificial Intelligence. All right reserved.
ASJC Scopus subject areas
- Artificial Intelligence