Manipulating Tournaments in Cup and Round Robin Competitions

Authors:
Tyrel Russell;Toby Walsh
Affiliations:
Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada;NICTA and UNSW, Sydney, Australia
Venue:
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Year:
2009

Citing 9
Cited 6

Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow

Operations Research
When are elections with few candidates hard to manipulate?

Journal of the ACM (JACM)
Copeland voting: ties matter

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
On the complexity of schedule control problems for knockout tournaments

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Team competition

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Winner determination in sequential majority voting

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Nonmanipulable selections from a tournament

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Where are the really hard manipulation problems? the phase transition in manipulating the veto rule

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The computational complexity of the elimination problem in generalized sports competitions

Discrete Optimization

Is computational complexity a barrier to manipulation?

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Determining possible and necessary winners under common voting rules given partial orders

Journal of Artificial Intelligence Research
Is computational complexity a barrier to manipulation?

Annals of Mathematics and Artificial Intelligence
Manipulating stochastically generated single-elimination tournaments for nearly all players

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Rigging tournament brackets for weaker players

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Cecision making under uncertainty: social choice and manipulation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.