Abstract
A tournament graph over n players is weakly transitive at player p if it contains a Hamiltonian path \(\left( p_{1},p_{2}, \dots , p_{n}\right) \) with \( p_{1}=p\) such that for all odd integers \(i\le n-2\) there is an arc from \(p_{i}\) to \(p_{i+2}\). We show that weak transitivity at p suffices to make player p win any extended stepladder tournament of degree at most two.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arlegi, R., Dimitrov, D.: Fair elimination-type competitions. Eur. J. Oper Res 287(2), 528–535 (2020). https://www.sciencedirect.com/science/article/abs/pii/S0377221720302393. Accessed 17 Mar 2020
Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., Walsh, T.: Fixing balanced knockout and double elimination tournaments. Artif. Intell. 262, 1–14 (2018)
Bang-Jensen, J., Gutin, G.: Digraphs: theory algorithms and applications. Springer, London (2008)
Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227–241 (1989)
Brams, S.J., Fishburn, P.C.: Voting procedures. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, pp. 173–236. Elsevier, Amsterdam (2002)
Kim, M.P., Suksompong, W., Williams, V.V.: Who can win a single-elimination tournament? SIAM J. Discrete Math. 31(3), 1751–1764 (2017)
Kim, M.P., Williams, V.V.: Fixing tournaments for kings, chokers, and more. In: Yang, Q., Wooldridge, M.J. (eds.) Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence IJCAI, pp. 561–567. AAAI Press, Palo Alto (2015)
Landau, H.: On dominance relations and the structure of animal societies: III the condition for score structure. Bull. Math. Biophys. 15(2), 143–148 (1953)
Laslier, J.F.: Tournament solutions and majority voting. Springer, Berlin (1997)
Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1988)
Shepsle, K.A., Weingast, B.R.: Uncovered sets and sophisticated outcomes with implications for agenda institutions. Am. J. Polit. Sci. 28(1), 49–74 (1984)
West, D.B.: Introduction to Graph Theory. Prentice-Hall, Upper Saddle River (2000)
Williams, V.V.: Knockout tournaments. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook on Computational Social Choice, pp. 453–474. Cambridge University Press, Cambridge (2016)
Yang, Y., Guo, J.: Possible winner problems on partial tournaments: a parameterized study. J. Comb. Optim. 33(3), 882–896 (2017)
Acknowledgements
Open Access funding provided by Projekt DEAL. The authors would like to thank the editor and the anonymous reviewers for valuable comments that improved the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Yang, Y., Dimitrov, D. Weak transitivity and agenda control for extended stepladder tournaments. Econ Theory Bull 9, 27–37 (2021). https://doi.org/10.1007/s40505-020-00190-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40505-020-00190-9