The flow network method
Computer Science and Game Theory
2018-01-15 v3
Abstract
In this paper we propose an in-depth analysis of a method, called the flow network method, which associates with any network a complete and quasi-transitive binary relation on its vertices. Such a method, originally proposed by Gvozdik (1987), is based on the concept of maximum flow. Given a competition involving two or more teams, the flow network method can be used to build a relation on the set of teams which establishes, for every ordered pair of teams, if the first one did at least as good as the second one in the competition. Such a relation naturally induces procedures for ranking teams and selecting the best teams of a competition. Those procedures are proved to satisfy many desirable properties.
Keywords
Cite
@article{arxiv.1606.03898,
title = {The flow network method},
author = {Daniela Bubboloni and Michele Gori},
journal= {arXiv preprint arXiv:1606.03898},
year = {2018}
}