In sports competitions, teams can manipulate the result by, for instance,
throwing games. We show that we can decide how to manipulate round robin and
cup competitions, two of the most popular types of sporting competitions in
polynomial time. In addition, we show that finding the minimal number of games
that need to be thrown to manipulate the result can also be determined in
polynomial time. Finally, we show that there are several different variations
of standard cup competitions where manipulation remains polynomial.Comment: Proceedings of Algorithmic Decision Theory, First International
Conference, ADT 2009, Venice, Italy, October 20-23, 200