Author:
Manurangsi Pasin,Suksompong Warut
Abstract
AbstractTournaments can be used to model a variety of practical scenarios including sports competitions and elections. A natural notion of strength of alternatives in a tournament is a generalized king: an alternative is said to be a k-king if it can reach every other alternative in the tournament via a directed path of length at most k. In this paper, we provide an almost complete characterization of the probability threshold such that all, a large number, or a small number of alternatives are k-kings with high probability in two random models. We show that, perhaps surprisingly, all changes in the threshold occur in the range of constant k, with the biggest change being between $$k=2$$
k
=
2
and $$k=3$$
k
=
3
. In addition, we establish an asymptotically tight bound on the probability threshold for which all alternatives are likely able to win a single-elimination tournament under some bracket.
Publisher
Springer Science and Business Media LLC
Reference51 articles.
1. Aziz, H., Brill, M., Fischer, F., Harrenstein, P., Lang, J., & Seedig, H. G. (2015). Possible and necessary winners of partial tournaments. Journal of Artificial Intelligence Research, 54, 493–534.
2. Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., & Walsh, T. (2018). Fixing balanced knockout and double elimination tournaments. Artificial Intelligence, 262, 1–14.
3. Baumeister, D. & Hogrebe, T. A. (2021). Complexity of scheduling and predicting round-robin tournaments. In Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 178–186.
4. Brandt, F., Brill, M., & Harrenstein, P. (2016). Tournament solutions. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. D. Procaccia (Eds.), Handbook of Computational Social Choice, chapter 3 (pp. 57–84). Cambridge: Cambridge University Press.
5. Brandt, F., Brill, M. & Seedig, H. G. (2011). On the fixed-parameter tractability of composition-consistent tournament solutions. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pages 85–90
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Query complexity of tournament solutions;Theoretical Computer Science;2024-04
2. Fixing knockout tournaments with seeds;Discrete Applied Mathematics;2023-11