The flow network method
Daniela Bubboloni () and
Michele Gori ()
Additional contact information
Daniela Bubboloni: Università degli Studi di Firenze
Social Choice and Welfare, 2018, vol. 51, issue 4, 621-656
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 (Abstracts of the VI-th Moscow conference of young scientists on cybernetics and computing. Scientific Council on Cybernetics of RAS, Moscow, p 56, 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 k teams of a competition. Those procedures are proved to satisfy many desirable properties.
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3) Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s00355-018-1131-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:51:y:2018:i:4:d:10.1007_s00355-018-1131-7
Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355
Access Statistics for this article
Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe
More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla ().