![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
Consider a deterministic tournament among N players in which the best M are to be found and ranked. A tournament design is presented in which the ratio of the number of comparisons to the minimum number required asymptotically approaches one. At any given stage, n − 1 players have been considered. The rath is compared with the player with temporary rank min (M, [n/2]). If, as a result, the nth is determined to be possibly one of the first M, then further comparisons are made by halving the set of temporarily ranked players within which the nth may be.