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. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Russell, T., & Walsh, T. (2009). Manipulating tournaments in cup and round robin competitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5783 LNAI, pp. 26–37). https://doi.org/10.1007/978-3-642-04428-1_3
Mendeley helps you to discover research relevant for your work.