1. Adams, E. W. (1965). Elements of a theory of inexact measurement. Philosophy of Science, 32(3/4), 641–651.
2. Anderson, I. (1997). Combinatorial designs and tournaments. Oxford lecture series in mathematics and its applications. Oxford: Clarendon Pr.
3. Bradley, R., & Terry, M. (1952). Rank analysis of incomplete block designs, I. The method of paired comparisons. Biometrika, 39, 324–345.
4. Brandt, F., Brill, M., & Harrenstein, P. (2016). Tournament solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of Computational Social Choice (pp. 57–84). Cambridge, UK: Cambridge University Press.
5. Brill, M., Faliszewski, P., Sommer, F., & Talmon, N. (2019). Approximation algorithms for balancedCC multiwinner rules. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) (pp. 494–502) Montreal: QC, Canada, May 13–17, 2019.