Preference orders on families of sets -- when can impossibility results be avoided?

DOI10.1613/JAIR.1.11879zbMATH Open1452.91117OpenAlexW2996874850MaRDI QIDQ5207046FDOQ5207046

Authors: Jan Malý, Mirosław Truszczyński, Stefan Woltran 

Publication date: 3 January 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11879

Recommendations

• Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results
• Extension of an order on a set to the power set: Some further observations
• Aggregating Partially Ordered Preferences
• On some axioms for ranking sets of alternatives
• Preference Structures and Co-comparability Graphs

zbMATH Keywords

dominanceimpossibility theoremspreference orderstrict independence

Mathematics Subject Classification ID

Applications of graph theory (05C90) Individual preferences (91B08)

Cited In (2)

• The voter basis and the admissibility of tree characters
• How to construct a partition when preference sets are given

This page was built for publication: Preference orders on families of sets -- when can impossibility results be avoided?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207046)