The outflow ranking method for weighted directed graphs

DOI10.1016/J.EJOR.2007.11.051MaRDI QIDQ958091zbMATH OpenOpenAlexFDO

Authors René van den Brink, Robert P. Gilles

Publication date 2 December 2008

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

Full work available at URL https://papers.tinbergen.nl/06044.pdf

zbMATH Keywords

axiomatizationdecision analysisoutflowranking methodweighted directed graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Ranking by outdegree for directed graphs
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• On different ranking methods
• The degree ratio ranking method for directed graphs
• Ranking by relational power based on digraphs

Cites work

• scientific article; zbMATH DE number 3280051 (Why is no real title available?)
• scientific article; zbMATH DE number 3361657 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Ranking by outdegree for directed graphs
• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• Ranking the Participants in a Tournament
• The Copeland choice function. An axiomatic characterization

Cited in

(19)

• Ranking methods based on valued preference relations. A characterization of the net flow method
• Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows
• Ranking by outdegree for directed graphs
• Mutual rankings
• Ranking the vertices of a complete multipartite paired comparison digraph
• The degree ratio ranking method for directed graphs
• On the monotonicity of the eigenvector method
• The flow network method
• Erratum to: ``Ranking by outdegree for directed graphs
• The positional power of nodes in digraphs
• The degree measure as utility function over positions in graphs and digraphs
• Ranking by relational power based on digraphs
• On different ranking methods
• Some impossibilities of ranking in generalized tournaments
• Weighted graph vertices ranking using absolute potentials of electric circuit nodes
• A generalization to networks of Young's characterization of the Borda rule
• The Copeland ratio ranking method for abstract decision problems
• Degree centrality, von Neumann-Morgenstern expected utility and externalities in networks
• Ranking the vertices of complete multipartite paired-comparison digraphs

This page was built for publication: The outflow ranking method for weighted directed graphs

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