The new FIFA rules are hard: complexity aspects of sports competitions

被引：15

作者：

Kern, W ^{[1
]}

Paulusma, D ^{[1
]}

机构：

[1] Univ Twente, Fac Math Sci, NL-7500 AE Enschede, Netherlands

来源：

DISCRETE APPLIED MATHEMATICS | 2001年 / 108卷 / 03期

关键词：

NP-complete; network flow;

D O I：

10.1016/S0166-218X(00)00241-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Consider a soccer 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 complexity of this question depends on the way scores are allocated according to the outcome of a match. For example, the problem is polynomially solvable for the ancient FIFA rules (2:0 resp. 1:1) but becomes NP-hard if the new rules (3:0 resp. 1:1) are applied. We determine the complexity of the above problem for all possible score allocation rules. (C) 2001 Elsevier Science B.V. All rights reserved. MSC: 03D15; 90C27.

引用

页码：317 / 323

页数：7