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.

MoreLess

Year of publication:	2006
Authors:	van den Brink, René ; Gilles, Robert P.
Publisher:	Amsterdam and Rotterdam : Tinbergen Institute
Subject:	Decision analysis \| Weighted directed graph \| Ranking method

More details

Series:	Tinbergen Institute Discussion Paper ; 06-044/1
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	837506417 [GVK] hdl:10419/86591 [Handle] RePEc:dgr:uvatin:20060044 [RePEc]
Classification:	C65 - Miscellaneous Mathematical Tools ; D71 - Social Choice; Clubs; Committees; Associations
Source:	EconStor

Persistent link: https://www.econbiz.de/10010325550