Document

# Variations on the Tournament Problem

## File

LIPIcs.FUN.2024.20.pdf
• Filesize: 0.95 MB
• 11 pages

## Cite As

Fabrizio Luccio, Linda Pagli, and Nicola Santoro. Variations on the Tournament Problem. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 20:1-20:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.FUN.2024.20

## Abstract

In 1883, Lewis Carrol wrote a newspaper article to criticize how the second best player was determined in a tennis tournament, and to suggest how such a task could be done correctly. This article has been taken by Donald Knuth as the inspiration for efficiently determining the smallest t elements of a totally ordered set of size n using k-comparisons. In the ensuing research, optimal algorithms for some low values of k and t have been established, by Knuth and Aigner; for k = 2 and t ≤ 3, a few new bounds have been established for special values of n. Surprisingly, very little else is known on this problem, in spite of its illustrious pedigree and its relationship to other classical problems (e.g., selection and sorting with k-sorters). Enticed by the undeniable beauty of the problem, and the obvious promise of fun, we have joined the investigative quest. The purpose of this paper is to share some new results obtained so far. We are glad to report advances in two directions.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Design and analysis of algorithms
• Computing methodologies → Parallel algorithms
• Mathematics of computing → Discrete mathematics
##### Keywords
• algorithms
• parallel algorithms
• tournament
• selection
• ranking

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Martin Aigner. Selecting the top three elements. Discrete Apllied Math., 4:247-267, 1982.
2. Richard Beigel and John Gill. Sorting n objects with a k-sorter. IEEE Transactions on Computers, 39:714-716, 1990.
3. D.Kirkpatrick. Closing a Long-standing Complexity Gap for Selection, volume 8066. LNTCS Springer, 2013.
4. Charles L. Dodgson. The fallacies of lown tennis tournaments. St. James Gazette, 1:5-6, 1883.
5. Donald E.Knuth. The Art of Computer Programming, Vol 3. Addison Wesley, 1973.
6. Jutta Eusterbrock. Errata to "selecting the top three elements by m. aigner: A result of a computer-assisted proof search". Discrete Applied Math., 41:131-137, 1993.
7. Susumu Horiguci and Willard L. Miranker. On parallel algorithm for finding the maximum value. Parallel Computing, 10:101-108, 1989.
8. Andras Ivanyi and Norbert Fogarasi. On partial sorting in restricted rounds. Acta Univ. Sapientiae, Informatica, 9:17-34, 2017.
9. Bruce Parker and Ian Parberry. Costructinfg sorting networks from k-sorters. Information Processing Letteers, 33:157-162, 1989.
10. Yo Shiloach and Uzi Vishkin. Finding the maximum, merging, and sorting in a parallel computational model. Journal of Algorithms, 2(88):88-102, 1981.
X

Feedback for Dagstuhl Publishing