The flow network method
| Autor: | Daniela Bubboloni, Michele Gori |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
FOS: Computer and information sciences
Economics and Econometrics Theoretical computer science Relation (database) Computer science Binary relation 05 social sciences Maximum flow problem Flow network Set (abstract data type) Ranking Computer Science - Computer Science and Game Theory 0502 economics and business Ordered pair Cybernetics 050206 economic theory 05C21 05C22 94C15 050207 economics Social Sciences (miscellaneous) Computer Science and Game Theory (cs.GT) |
| Zdroj: | Social Choice and Welfare. 51:621-656 |
| ISSN: | 1432-217X 0176-1714 |
| DOI: | 10.1007/s00355-018-1131-7 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |