Arbeitspapier
The Outflow Ranking Method for Weighted Directed Graphs
A ranking method assigns to every weighted directed graph a (weak) orderingof the nodes. In this paper we axiomatize the ranking method that ranksthe nodes according to their outflow using four independent axioms. This outflowranking method generalizes the ranking by outdegree for directed graphs.Furthermore, we compare our axioms with other axioms discussed in the literature.
- Language
-
Englisch
- Bibliographic citation
-
Series: Tinbergen Institute Discussion Paper ; No. 06-044/1
- Classification
-
Wirtschaft
Miscellaneous Mathematical Tools
Social Choice; Clubs; Committees; Associations
- Subject
-
Decision analysis
Weighted directed graph
Ranking method
- Event
-
Geistige Schöpfung
- (who)
-
van den Brink, René
Gilles, Robert P.
- Event
-
Veröffentlichung
- (who)
-
Tinbergen Institute
- (where)
-
Amsterdam and Rotterdam
- (when)
-
2006
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- van den Brink, René
- Gilles, Robert P.
- Tinbergen Institute
Time of origin
- 2006
Other Objects (12)
The Degree Ratio Ranking Method for Directed Networks
Directed and weighted majority games
Visual analytics of large weighted directed graphs and two-dimensional time-dependent data
Rankings and preferences : new results in weighted correlation and weighted principal component analysis with applications
Ranking Economics and Econometrics ISI Journals by Quality Weighted Citations
On stochastic completeness of weighted graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
A ranking method based on handicaps
A Ranking Method Based on Handicaps
The Degree Ratio Ranking Method for Directed Networks
Directed and weighted majority games
Visual analytics of large weighted directed graphs and two-dimensional time-dependent data
Rankings and preferences : new results in weighted correlation and weighted principal component analysis with applications
Ranking Economics and Econometrics ISI Journals by Quality Weighted Citations
On stochastic completeness of weighted graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
A ranking method based on handicaps
A Ranking Method Based on Handicaps
The Degree Ratio Ranking Method for Directed Networks
Directed and weighted majority games
Visual analytics of large weighted directed graphs and two-dimensional time-dependent data
Rankings and preferences : new results in weighted correlation and weighted principal component analysis with applications
Ranking Economics and Econometrics ISI Journals by Quality Weighted Citations
On stochastic completeness of weighted graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
A ranking method based on handicaps