On the complexity of schedule control problems for knockout tournaments
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
A new perspective on implementation by voting trees
Proceedings of the 10th ACM conference on Electronic commerce
A method for combining complementary techniques for document image segmentation
Pattern Recognition
Optimal seeding in knockout tournaments
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Rigging tournament brackets for weaker players
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
AT'13 Proceedings of the Second international conference on Agreement Technologies
From blurry numbers to clear preferences: A mechanism to extract reputation in social networks
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
We investigated the existence of fair seeding in knockout tournaments. We define two fairness criteria, both adapted from the literature: envy-freeness and order preservation. We show how to achieve the first criterion in tournaments whose structure is unconstrained, and prove an impossibility result for balanced tournaments. For the second criterion we have a similar result for unconstrained tournaments, but not for the balanced case. We provide instead a heuristic algorithm which we show through experiments to be efficient and effective. This suggests that the criterion is achievable also in balanced tournaments. However, we prove that it again becomes impossible to achieve when we add a weak condition guarding against the phenomenon of tournament dropout.