Ranking methods based on valued preference relations. A characterization of the net flow method
From MaRDI portal
Publication:1198298
DOI10.1016/0377-2217(92)90333-5zbMath0762.90001OpenAlexW2054588792MaRDI QIDQ1198298
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)90333-5
Decision theory (91B06) Management decision making, including multiple objectives (90B50) Individual preferences (91B08)
Related Items (36)
Dominance-Based Rough Set Approach: Basic Ideas and Main Trends ⋮ MCDM methods in strategic planning of forestry on state‐owned lands in Finland: applications and experiences ⋮ Rank-based modelling of preferences in multi-criteria decision making ⋮ Scaling-invariant maximum margin preference learning ⋮ The degree measure as utility function over positions in graphs and digraphs ⋮ Automating human thought processes for a UAV forced landing ⋮ The flow network method ⋮ An impossibility theorem for paired comparisons ⋮ A stochastic method for exploiting outranking relations in multicriteria choice problems ⋮ Ranking by outdegree for directed graphs ⋮ Bipolar preference modeling and aggregation in decision support ⋮ A method based on multiobjective optimization for deriving a ranking from a fuzzy preference relation. ⋮ Positionalist voting rules: a general definition and axiomatic characterizations ⋮ Some Impossibilities of Ranking in Generalized Tournaments ⋮ A characterization of the logarithmic least squares method ⋮ Variable consistency dominance-based rough set approach to preference learning in multicriteria ranking ⋮ Multicriteria decision support using rules that represent rough-graded preference relations ⋮ A note on the sum of differences choice function for fuzzy preference relations ⋮ Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows ⋮ The outflow ranking method for weighted directed graphs ⋮ On the (numerical) ranking associated with any finite binary relation ⋮ Characterizations of the 3-cycle count and backward length of a tournament ⋮ Computer science and decision theory ⋮ The degree ratio ranking method for directed graphs ⋮ Non-dominated sorting genetic-based algorithm for exploiting a large-sized fuzzy outranking relation ⋮ On the monotonicity of the eigenvector method ⋮ An automatic ranking approach for multi-criteria group decision making under intuitionistic fuzzy environment ⋮ Axiomatizations of the \(\beta\) and the score measures in networks ⋮ Robust and neutral methods for aggregating preferences into an outranking relation ⋮ A note on the use of PROMETHEE multicriteria methods ⋮ Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons ⋮ A new decision making model based on rank centrality for GDM with fuzzy preference relations ⋮ Unnamed Item ⋮ Rough approximation of a preference relation by dominance relations ⋮ On Different Ranking Methods ⋮ Outranking Relations: Do They Have Special Properties?
Cites Work
- The Copeland choice function. An axiomatic characterization
- Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
- A proof technique for social choice with variable electorate
- Note—A Preference Ranking Organisation Method
- Ranking the Participants in a Tournament
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ranking methods based on valued preference relations. A characterization of the net flow method
