Exploitation of a crisp relation in a ranking problem

DOI10.1007/BF00134150zbMath0756.90007OpenAlexW2040598781MaRDI QIDQ1193764

Philippe Vincke

Publication date: 27 September 1992

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00134150

zbMATH Keywords

rankingoutrankingpreference relation

Mathematics Subject Classification ID

Individual preferences (91B08)

Related Items (15)

ELECTRE: A comprehensive literature review on methodologies and applications ⋮ A general decomposition approach for multi-criteria decision trees ⋮ Une typologie des méthodes multicritères: Proposition d'un cadre méthodologique ⋮ Deriving a final ranking from fuzzy preferences: An approach compatible with the principle of correspondence ⋮ Bi-oriented graphs and four valued logic for preference modelling ⋮ Bipolar preference modeling and aggregation in decision support ⋮ Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking ⋮ Consistent union and prioritized consistent union: new operations for preference aggregation ⋮ On the (numerical) ranking associated with any finite binary relation ⋮ Computer science and decision theory ⋮ A real-world MCDA application: evaluating software ⋮ Argumentation Theory and Decision Aiding ⋮ Robust and neutral methods for aggregating preferences into an outranking relation ⋮ Extensions of the prudence principle to exploit a valued outranking relation ⋮ Outranking Relations: Do They Have Special Properties?

Cites Work

• Preference modelling
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• Unnamed Item

This page was built for publication: Exploitation of a crisp relation in a ranking problem