The outflow ranking method for weighted directed graphs
AbstractA ranking method assigns to every weighted directed graph a (weak) ordering of the nodes. In this paper we axiomatize the ranking method that ranks the nodes according to their outflow using four independent axioms. Besides the well-known axioms of anonymity and positive responsiveness we introduce outflow monotonicity - meaning that in pairwise comparison between two nodes, a node is not doing worse in case its own outflow does not decrease and the other node's outflow does not increase - and order preservation - meaning that adding two weighted digraphs such that the pairwise ranking between two nodes is the same in both weighted digraphs, then this is also their pairwise ranking in the 'sum' weighted digraph. The outflow ranking method generalizes the ranking by outdegree for directed graphs, and therefore also generalizes the ranking by Copeland score for tournaments.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 193 (2009)
Issue (Month): 2 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Decision analysis Weighted directed graph Ranking method Outflow Axiomatization;
Other versions of this item:
- René van den Brink & Robert P. Gilles, 0000. "The Outflow Ranking Method for Weighted Directed Graphs," Tinbergen Institute Discussion Papers 06-044/1, Tinbergen Institute.
- C65 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Miscellaneous Mathematical Tools
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bouyssou, Denis, 1992. "Ranking methods based on valued preference relations: A characterization of the net flow method," European Journal of Operational Research, Elsevier, vol. 60(1), pages 61-67, July.
- Gabrielle Demange, 2014.
"A Ranking Method Based on Handicaps,"
CESifo Working Paper Series
4636, CESifo Group Munich.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.