### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 13 |

ISBN (Print) | 0169-2690 |

Publication status | Published - 2002 |

### Publication series

Name | Memorandum Faculteit TW |
---|---|

Publisher | Department of Applied Mathematics, University of Twente |

No. | 1620 |

ISSN (Print) | 0169-2690 |

### Keywords

- METIS-208506
- MSC-90C27
- IR-65807
- EWI-3440
- MSC-03D15

### Cite this

*The generalized sports competition problem*. (Memorandum Faculteit TW; No. 1620). Enschede: University of Twente, Department of Applied Mathematics.

}

*The generalized sports competition problem*. Memorandum Faculteit TW, no. 1620, University of Twente, Department of Applied Mathematics, Enschede.

**The generalized sports competition problem.** / Kern, Walter; Paulusma, Daniël.

Research output: Book/Report › Report › Professional

TY - BOOK

T1 - The generalized sports competition problem

AU - Kern, Walter

AU - Paulusma, Daniël

N1 - Imported from MEMORANDA

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - METIS-208506

KW - MSC-90C27

KW - IR-65807

KW - EWI-3440

KW - MSC-03D15

M3 - Report

SN - 0169-2690

T3 - Memorandum Faculteit TW

BT - The generalized sports competition problem

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -