2023
Journal article  Open Access

An optimal algorithm for finding champions in tournament graphs

Beretta L., Nardini F. M., Trani R., Venturini R.

Tournament graph  Computational Theory and Mathematics  Information Retrieval (cs.IR)  FOS: Computer and information sciences  Computer Science Applications  Information Systems  Data Structures and Algorithms (cs.DS) 

A tournament graph is a complete directed graph, which can be used to model a round-robin tournament between n players. In this 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. In detail, we aim to investigate algorithms that find the champion by playing a low number of matches. Solving this problem allows us to speed up several Information Retrieval and Recommender System applications, including question answering, conversational search, etc. Indeed, these applications often search for the champion inducing a round-robin tournament among the players by employing a machine learning model to estimate who wins each pairwise comparison. Our contribution, thus, allows finding the champion by performing a low number of model inferences. We prove that any deterministic or randomized algorithm finding a champion with constant success probability requires ?(ln) comparisons, where l is the number of matches lost by the champion. We then present an asymptotically-optimal deterministic algorithm matching this lower bound without knowing l , and we extend our analysis to three variants of the problem. Lastly, we conduct a comprehensive experimental assessment of the proposed algorithms on a question answering task on public data. Results show that our proposed algorithms speed up the retrieval of the champion up to 13× with respect to the state-of-the-art algorithm that perform the full tournament.

Source: IEEE transactions on knowledge and data engineering (Online) 35 (2023): 10197–10209. doi:10.1109/TKDE.2023.3267345

Publisher: Institute of Electrical and Electronics Engineers,, New York, NY , Stati Uniti d'America


Metrics



Back to previous page
BibTeX entry
@article{oai:it.cnr:prodotti:487712,
	title = {An optimal algorithm for finding champions in tournament graphs},
	author = {Beretta L. and Nardini F. M. and Trani R. and Venturini R.},
	publisher = {Institute of Electrical and Electronics Engineers,, New York, NY , Stati Uniti d'America},
	doi = {10.1109/tkde.2023.3267345 and 10.48550/arxiv.2111.13621},
	journal = {IEEE transactions on knowledge and data engineering (Online)},
	volume = {35},
	pages = {10197–10209},
	year = {2023}
}