The degree ratio ranking method for directed graphs

DOI10.1016/j.ejor.2020.06.013zbMath1487.91039OpenAlexW3039525325MaRDI QIDQ2028895

Agnieszka Rusinowska, René van den Brink

Publication date: 3 June 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.013

zbMATH Keywords

directed graphgroup decisions and negotiationsranking methodCopeland scoredegree ratio

Mathematics Subject Classification ID

Decision theory (91B06) Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items (2)

The degree measure as utility function over positions in graphs and digraphs ⋮ On Different Ranking Methods

Cites Work

• Unnamed Item
• Unnamed Item
• Collective attention and ranking methods
• An axiomatic characterization of the Hirsch-index
• The outflow ranking method for weighted directed graphs
• 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
• Mutual rankings
• Competitive economy as a ranking device over networks
• On the influence of a ranking system
• Impartial division of a dollar
• Scoring of web pages and tournaments-axiomatizations
• Ranking the Participants in a Tournament
• A ranking method based on handicaps
• The Measurement of Intellectual Influence

This page was built for publication: The degree ratio ranking method for directed graphs