|
Activity Number:
|
69
|
|
Type:
|
Contributed
|
|
Date/Time:
|
Sunday, July 29, 2007 : 4:00 PM to 5:50 PM
|
|
Sponsor:
|
Section on Statistics in Sports
|
| Abstract - #309325 |
|
Title:
|
Sorting Algorithms and Sport Tournaments
|
|
Author(s):
|
Hans Block*+
|
|
Companies:
|
KTH, Stockholm, Sweden
|
|
Address:
|
Monstringsvagen 126, Akersberga, S-18433, Sweden
|
|
Keywords:
|
Parallel sorting ; Sport tournaments
|
|
Abstract:
|
Many types of tournament schemes are used in different sports. We want to construct a scheme which gives the whole ranking order when pairs of athletes or teams compete. The scheme should be efficient, fair, and thrilling. The problem can be formulated as parallel sorting. The proposed algorithm will, according to simulations, take approximately $2.4\cdot\lg n$ rounds in a tournament with $n$ participants. The computations will in most cases take $O(n^{2}\cdot\log\ n)$ steps. However, both faster and slower special cases exist. Some limits for the number of rounds are given for variants of the algorithm. The scheme has been used with good results in real tournaments with up to 40 participants. At last we discuss in which branches of sports this algorithm will be most useful.
|
- The address information is for the authors that have a + after their name.
- Authors who are presenting talks have a * after their name.
Back to the full JSM 2007 program |
