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.
- Network Flow