在WTA和ATP网球巡回赛中引入公平和多元化
Introducing Fairness and Diversification in WTA and ATP Tennis Tournaments Generation
摘要:
单淘汰赛是主要网球职业协会的标准模式。赛程表是通过分配第一种子选手和非种子选手来生成的,这些选手的种子在比赛初期不会相遇。此外,非种子选手和种子选手在第一轮比赛中的配对分布可能是非常不平衡的。这往往提供了一个很大的不利条件,一些“不幸的”非种子选手方面的金钱奖励。此外,在一个赛季中公平分配比赛将受益于在第一轮中限制最近相遇的球员之间的头对头(H2H)比赛。我们提出了一种比赛生成方法,以减少在第一轮的“不幸”配对和重放的H2H比赛。该方法包括在一个聚类优化问题,从而导致每个集群内绘制。提出了一个非线性数学规划模型来求解聚类问题,以达到公平调度。商业NLMP求解器上的模型达到的解决方案相比,达到一个更快的混合算法的基础上多开始局部搜索。该方法成功地测试了最近的大满贯赛事的历史记录。
英文摘要:
Single-elimination tournaments are the standard paradigm both for the main tennis professional associations. Schedules are generated by allocating first seeded and then unseeded players with seeds prevented from encountering each other early in the competition. Besides, the distribution of pairings in the first round between unseeded players and seeds for a yearly season may be strongly unbalanced. This provides often a great disadvantage to some "unlucky" unseeded players in terms of money prizes. Also, a fair distribution of matches during a season would benefit from limiting in first rounds the presence of Head-to-Head (H2H) matches between players that met in the recent past. We propose a tournament generation approach in order to reduce in the first round "unlucky" pairings and replay of H2H matches. The approach consists in a clustering optimization problem inducing a consequent draw within each cluster. A Non-Linear Mathematical Programming (NLMP) model is proposed for the clustering problem so as to reach a fair schedule. The solution reached by a commercial NLMP solver on the model is compared to the one reached by a faster hybrid algorithm based on multi-start local search. The approach is successfully tested on historical records from the recent Grand Slams tournaments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。