Consistent union and prioritized consistent union: new operations for preference aggregation

DOI10.1007/S10479-011-0852-0zbMATH Open1259.91041OpenAlexW1978686383WikidataQ60256694 ScholiaQ60256694MaRDI QIDQ1761876FDOQ1761876

B. De Baets, Michaël Rademaker

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0852-0

zbMATH Keywords

transitivitypreference aggregationpreference relationdecision supportstrict partial order relation

Mathematics Subject Classification ID

Decision theory (91B06)

Cites Work

• Default reasoning and possibility theory
• A Theorem on Boolean Matrices
• Condorcet Social Choice Functions
• On the existence and construction of \(T\)-transitive closures.
• Operators and Laws for Combining Preference Relations
• Label ranking by learning pairwise preferences
• Machine Learning: ECML 2003
• Exploitation of a crisp relation in a ranking problem
• Aggregating Partially Ordered Preferences
• Fuzzy preference structures without incomparability
• Characterizable fuzzy preference structures
• Database querying under changing preferences
• Relational Databases with Ordered Relations

Uses Software

• Algorithm 97

This page was built for publication: Consistent union and prioritized consistent union: new operations for preference aggregation

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