论在不完全信息下控制淘汰赛
On Controlling Knockout Tournaments Without Perfect Information
AI总结:
研究在不完全信息下单淘汰锦标赛的赛程安排问题,识别输入实例关键属性以最大化特定选手获胜几率,并首次提出适用于不完全信息场景的固定参数可处理性结果。
摘要:
过去十年中,关于设计单淘汰(SE)锦标赛的算法方面已有广泛研究。为解决算法可处理性的自然问题,我们识别了输入实例的关键属性,使锦标赛设计者能够高效安排赛程,从而最大化特定选手获胜的几率。先前关于此主题的大部分算法工作集中于完美(完整且确定性)信息场景,特别是在固定参数算法设计的背景下。我们的贡献是首个适用于具有潜在不完全信息的SE锦标赛设计更一般设定的固定参数可处理性结果。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。