On Controlling Knockout Tournaments Without Perfect Information
<|reference_start|>On Controlling Knockout Tournaments Without Perfect Information: Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic tractability, we identify key properties of input instances that enable the tournament designer to efficiently schedule the tournament in a way that maximizes the chances of a preferred player winning. Much of the prior algorithmic work on this topic focuses on the perfect (complete and deterministic) information scenario, especially in the context of fixed-parameter algorithm design. Our contributions constitute the first fixed-parameter tractability results applicable to more general settings of SE tournament design with potential imperfect information.<|reference_end|>
@article{blažej2024on,
    title={On Controlling Knockout Tournaments Without Perfect Information},
    author={V'aclav Blav{z}ej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo},
    journal={arXiv preprint arXiv:2408.15068},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.15068},
    primaryClass={cs.DS cs.GT}
}