大型旅游项目选择的鲁棒界
Robust Bounds on Choosing from Large Tournaments
摘要:
锦标赛解决方案提供了从锦标赛中选择“最佳”备选方案的方法,并已在广泛的领域中得到应用。以前的工作表明,几个著名的比赛解决方案几乎从来没有排除任何替代大型随机比赛。然而,迄今为止,所有的分析结果都假设了一个刚性的概率模型,在该模型中,要么比赛是随机均匀选择的,要么有一个线性顺序的替代品,并且比赛中所有边的方向是根据线性顺序以相同的概率选择的。在这项工作中,我们考虑了一个显着更一般的模型,不同的边缘的方向可以选择不同的概率。我们发现,一些常见的锦标赛解决方案,包括顶部循环和未覆盖集,仍然不太可能排除任何替代方案在此模型下。这对应于自然的图论条件,如不可约的比赛。此外,我们在锦标赛解以高概率选择所有替代方案的概率范围边界上提供了严格的渐进界限。
英文摘要:
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out any alternative in large random tournaments. Nevertheless, all analytical results thus far have assumed a rigid probabilistic model, in which either a tournament is chosen uniformly at random, or there is a linear order of alternatives and the orientation of all edges in the tournament is chosen with the same probabilities according to the linear order. In this work, we consider a significantly more general model where the orientation of different edges can be chosen with different probabilities. We show that a number of common tournament solutions, including the top cycle and the uncovered set, are still unlikely to rule out any alternative under this model. This corresponds to natural graph-theoretic conditions such as irreducibility of the tournament. In addition, we provide tight asymptotic bounds on the boundary of the probability range for which the tournament solutions select all alternatives with high probability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。