On partial sorting in restricted rounds
Let n and k be integers such that n ≥ 2 and 1 ≤ k ≤n. In this paper, we consider the problem of finding an ordered list of the k best players out of n participants by organizing a tournament of rounds of pairwise matches (comparisons). Assuming that (i) in each match there is a winner (no ties) (ii)...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-07-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/ausi-2017-0002 |