1. Aziz H, Brill M, Fischer F, Harrenstein P, Lang J, Seeding HG (2015) Possible and necessary winners of partial tournaments. J Artif Intell Res 54:493–534
2. Bang-Jensen J, Gutin G (2008) Digraphs theory. Algorithms and applications. Springer, New York
3. Belkin AR, Gvozdik AA (1989) The flow model for ranking objects. In: Dorofeyuk A, Litvak B, Tjurin Yu (eds) Problems of cybernetics, decision making and analysis of expert information, Moscow, pp 109–117 (in Russian)
4. Bouyssou D (1992) Ranking methods based on valued preference relations: a characterization of the net flow method. Eur J Oper Res 60:61–67
5. Brandt F, Brill M, Harrenstein P (2016) Extending tournament solutions. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence