The outflow ranking method for weighted directed graphs

@article{Brink2009TheOR,
  title={The outflow ranking method for weighted directed graphs},
  author={Ren{\'e} van den Brink and Robert P. Gilles},
  journal={European Journal of Operational Research},
  year={2009},
  volume={193},
  pages={484-491}
}
A 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. This outflow ranking method generalizes the ranking by outdegree for directed graphs. Furthermore, we compare our axioms with other axioms discussed in the literature. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The Copeland Choice Function: An Axiomatic Characterization

  • D. Henriet
  • Social Choice and Welfare
  • 1985
1 Excerpt

Collective Choice and Social Welfare (North Holland Publishing

  • A. K. Sen
  • 1979
2 Excerpts

A ‘Reasonable’ Social Welfare Function, Mimeographed notes, University of Michigan

  • A. H. Copeland
  • Seminar on Applications of Mathematics to the…
  • 1951

Similar Papers

Loading similar papers…