Computing with unreliable information
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Noisy sorting without resampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of schedule control problems for knockout tournaments
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
Manipulating Tournaments in Cup and Round Robin Competitions
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Rigging tournament brackets for weaker players
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
We study the power of a tournament organizer in manipulating the outcome of a balanced single-elimination tournament by fixing the initial seeding. This problem is known as agenda control for balanced voting trees . It is not known whether there is a polynomial time algorithm that computes a seeding for which a given player can win the tournament, even if the match outcomes for all pairwise player match-ups are known in advance. We approach the problem by giving a sufficient condition under which the organizer can always efficiently find a tournament seeding for which the given player will win the tournament. We then use this result to show that for most match outcomes generated by a natural random model attributed to Condorcet, the tournament organizer can very efficiently make a large constant fraction of the players win, by manipulating the initial seeding.