Abstract
A tournament graph \(T = \left( V, E \right) \) is an oriented complete graph, which can be used to model a round-robin tournament between n players. In this short paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player that wins the highest number of matches. Our goal is to solve the problem by minimizing the number of arc lookups, i.e., the number of matches played. We prove that finding a champion requires \(\varOmega (\ell n)\) comparisons, where \(\ell \) is the number of matches lost by the champion, and we present a deterministic algorithm matching this lower bound without knowing \(\ell \). Solving this problem has important implications on several Information Retrieval applications including Web search, conversational AI, machine translation, question answering, recommender systems, etc.
This paper is partially supported by the BIGDATAGRAPES (EU H2020 RIA, grant agreement
780751), the “Algorithms, Data Structures and Combinatorics for Machine Learning” (MIUR-PRIN 2017), the OK-INSAID (MIUR-PON 2018, grant agreement
ARS01_00917) projects, and Scuola Normale Superiore.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ailon, N., Mohri, M.: An efficient reduction of ranking to classification. In: Servedio, R.A., Zhang, T. (eds.) 21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, 9–12 July 2008, pp. 87–98. Omnipress (2008). http://colt2008.cs.helsinki.fi/papers/32-Ailon.pdf
Ailon, N., Mohri, M.: Preference-based learning to rank. Mach. Learn. 80(2–3), 189–211 (2010). https://doi.org/10.1007/s10994-010-5176-9
Banks, J.S.: Sophisticated voting outcomes and agenda control. Soc. Choice Welf. 1(4), 295–306 (1985)
Brandt, F., Brill, M., Harrenstein, P.: Tournament solutions. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 57–84. Cambridge University Press, Cambridge (2016). https://doi.org/10.1017/CBO9781107446984.004
Charbit, P., Thomassé, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Comb. Probab. Comput. 16, 1–4 (2007). https://doi.org/10.1017/S0963548306007887
Copeland, A.H.: A reasonable social welfare function. Technical report, Mimeo, University of Michigan (1951)
Gutin, G.Z., Mertzios, G.B., Reidl, F.: Searching for maximum out-degree vertices in tournaments. CoRR abs/1801.04702 (2018), http://arxiv.org/abs/1801.04702
Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004). https://doi.org/10.1145/963770.963772
Hudry, O.: A survey on the complexity of tournament solutions. Math. Soc. Sci. 57(3), 292–303 (2009). https://doi.org/10.1016/j.mathsocsci.2008.12.002
Laslier, J.F.: Tournament Solutions and Majority Voting, vol. 7. Springer, Heidelberg (1997)
Maarek, Y.: Alexa and her shopping journey. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, CIKM 2018, p. 1. ACM, New York (2018). https://doi.org/10.1145/3269206.3272923
Moon, J.W.: Topics on Tournaments. Holt, Rinehart, and Winston, New York (1968)
Reid, K.B.: Tournaments. In: Gross, J.L., Yellen, J., Zhang, P. (eds.) Handbook of Graph Theory, 2nd edn. Chapman and Hall/CRC, New York (2013)
Shen, J., Sheng, L., Wu, J.: Searching for sorted sequences of kings in tournaments. SIAM J. Comput. 32, 1201–1209 (2003). https://doi.org/10.1137/S0097539702410053
Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48(3/4), 303–312 (1961)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Beretta, L., Nardini, F.M., Trani, R., Venturini, R. (2019). An Optimal Algorithm to Find Champions of Tournament Graphs. In: Brisaboa, N., Puglisi, S. (eds) String Processing and Information Retrieval. SPIRE 2019. Lecture Notes in Computer Science(), vol 11811. Springer, Cham. https://doi.org/10.1007/978-3-030-32686-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-32686-9_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32685-2
Online ISBN: 978-3-030-32686-9
eBook Packages: Computer ScienceComputer Science (R0)