Kern, W. and Paulusma, Daniel (2004) 'The computational complexity of the elimination problem in generalized sports competitions.', Discrete optimization., 1 (2). pp. 205-214.
Consider a sports competition among various teams playing against each other in pairs (matches) according to a previously determined schedule. At some stage of the competition one may ask whether a particular team still has a (theoretical) chance to win the competition. The computational complexity of this question depends on the way scores are allocated according to the outcome of a match. For competitions with at most 3 different outcomes of a match the complexity is already known. In practice there are many competitions in which more than 3 outcomes are possible. We determine the complexity of the above problem for competitions with an arbitrary number of different outcomes. Our model also includes competitions that are asymmetric in the sense that away playing teams possibly receive other scores than home playing teams.
|Keywords:||Elimination problem, NP-complete, Network flow.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1016/j.disopt.2003.12.003|
|Record Created:||23 Apr 2008|
|Last Modified:||22 Mar 2013 13:23|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|