AI 中文总结
研究不完整循环赛的公平抽签问题，确定在多种情况下判断公平抽签是否存在的复杂性，并通过实验展示生成公平不完整循环赛的方法。
AI 中文摘要
在不完整循环赛中，各队与不同对手组比赛。考虑到各队实力不同，这引发了公平性问题。我们确定了在各种情况下，如存在分组（即基于实力的团队组）、来自同一协会的团队、连通性要求等时，判断公平抽签是否存在的复杂性。我们还通过实验展示了如何生成公平的不完整循环赛。
英文摘要
In an incomplete round robin tournament, teams play against different sets of opponents. Given varying strengths of the teams, this raises a fairness issue. We establish the complexity of determining whether a fair draw exists under various scenarios involving the presence of pots (i.e., strength based groups of teams), teams coming from the same association, connectivity requirements, and others. We also show experimentally how fair incomplete round robin tournaments can be generated.
