Maximum Matchings via Gaussian Elimination
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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
SIAM Journal on Discrete Mathematics
Noisy sorting without resampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A new perspective on implementation by voting trees
Proceedings of the 10th ACM conference on Electronic commerce
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
Optimal seeding in knockout tournaments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Fair Seeding in Knockout Tournaments
ACM Transactions on Intelligent Systems and Technology (TIST)
Manipulating stochastically generated single-elimination tournaments for nearly all players
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
| Hi-index | 0.00 |
Consider the following problem in game manipulation. A tournament designer who has full knowledge of the match outcomes between any possible pair of players would like to create a bracket for a balanced single-elimination tournament so that their favorite player will win. Although this problem has been studied in the areas of voting and tournament manipulation, it is still unknown whether it can be solved in polynomial time. We focus on identifying several general cases for which the tournament can always be rigged efficiently so that the given player wins. We give constructive proofs that, under some natural assumptions, if a player is ranked among the top K players, then one can efficiently rig the tournament for the given player, even when K is as large as 19% of the players.