The outflow ranking method for weighted directed graphs

DOI10.1016/j.ejor.2007.11.051zbMath1170.05312OpenAlexW2126076627MaRDI QIDQ958091

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

decision analysisaxiomatizationweighted directed graphoutflowranking method

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

The degree measure as utility function over positions in graphs and digraphs ⋮ Mutual rankings ⋮ The flow network method ⋮ Some Impossibilities of Ranking in Generalized Tournaments ⋮ The degree ratio ranking method for directed graphs ⋮ On the monotonicity of the eigenvector method ⋮ On Different Ranking Methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Copeland choice function. An axiomatic characterization
• 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
• Ranking the Participants in a Tournament

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