Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results

DOI10.1613/JAIR.1.13030MaRDI QIDQ5026251zbMATH OpenOpenAlexWikidataFDO

Authors Jan Malý

Publication date 7 February 2022

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

Full work available at URL https://arxiv.org/abs/2104.05425

zbMATH Keywords

decision theorypreferences

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• scientific article; zbMATH DE number 892081
• Ranking opportunity sets and Arrow impossibility theorems: Correspondence results
• On some axioms for ranking sets of alternatives
• Automated search for impossibility theorems in social choice theory: ranking sets of objects
• Theoretical and complexity results for minimal rankings
• Ranking sets of interacting objects via semivalues
• On the complexity of ranking
• scientific article; zbMATH DE number 679898
• Ranking sets additively in decisional contexts: an axiomatic characterization
• Some remarks on ranking opportunity sets and Arrow impossibility theorems: correspondence results

Cites work

• Expected utility consistent extensions of preferences
• Succinct representations of graphs

Cited in

(5)

• An Arrovian impossibility in combining ranking and evaluation
• scientific article; zbMATH DE number 3887106 (Why is no real title available?)
• scientific article; zbMATH DE number 892081 (Why is no real title available?)
• Preference orders on families of sets -- when can impossibility results be avoided?
• Constraints and lifting-based (conditional) preferences in abstract argumentation

This page was built for publication: Ranking Sets of Objects: The Complexity of Avoiding Impossibility Results

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