The computational complexity of the elimination problem in generalized sports competitions

Walter Kern, Daniël Paulusma

Research output: Contribution to journalArticleAcademicpeer-review

24 Citations (Scopus)
23 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)205-214
Number of pages10
JournalDiscrete optimization
Volume1
Issue number2
DOIs
Publication statusPublished - 2004

Keywords

  • Network Flow
  • NP-complete
  • Elimination problem

Fingerprint Dive into the research topics of 'The computational complexity of the elimination problem in generalized sports competitions'. Together they form a unique fingerprint.

  • Cite this