Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows

DOI10.1016/0377-2217(92)90279-IMaRDI QIDQ1200329zbMATH OpenOpenAlexFDO

Authors Denis Bouyssou, Patrice Perny

Publication date 16 January 1993

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(92)90279-i

zbMATH Keywords

partial rankingvalued preference relation

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Management decision making, including multiple objectives (90B50) Decision theory (91B06) Individual preferences (91B08)

Recommendations

• Ranking methods based on valued preference relations. A characterization of the net flow method
• Note—A Preference Ranking Organisation Method
• scientific article; zbMATH DE number 591238
• The outflow ranking method for weighted directed graphs
• Ranking Alternatives on the Basis of Preference Relations: A Progress Report with Special Emphasis on Outranking Relations

Cites work

• scientific article; zbMATH DE number 3912087 (Why is no real title available?)
• Note—A Preference Ranking Organisation Method
• On choosing rationally when preferences are fuzzy
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking the Participants in a Tournament
• The Copeland choice function. An axiomatic characterization

Cited in

(22)

• Exploitation of a crisp relation in a ranking problem
• Ranking methods based on valued preference relations. A characterization of the net flow method
• A note on the use of PROMETHEE multicriteria methods
• Negotiation support systems: A multi-criteria and multi-agent approach
• Robust and neutral methods for aggregating preferences into an outranking relation
• A note on the internal consistency of various preference representations
• The degree ratio ranking method for directed graphs
• On the monotonicity of the eigenvector method
• Computer science and decision theory
• PROMETHEE: a comprehensive literature review on methodologies and applications
• The flow network method
• The degree measure as utility function over positions in graphs and digraphs
• scientific article; zbMATH DE number 591238 (Why is no real title available?)
• MCDM methods in strategic planning of forestry on state‐owned lands in Finland: applications and experiences
• Outranking Relations: Do They Have Special Properties?
• On different ranking methods
• Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking
• Some impossibilities of ranking in generalized tournaments
• Rank-based modelling of preferences in multi-criteria decision making
• Degree centrality, von Neumann-Morgenstern expected utility and externalities in networks
• Qualitative decision theory with preference relations and comparative uncertainty: an axiomatic approach
• The outflow ranking method for weighted directed graphs

This page was built for publication: Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows

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