{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T18:18:02Z","timestamp":1792088282228,"version":"4.4.0"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T00:00:00Z","timestamp":1780185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T00:00:00Z","timestamp":1786406400000},"content-version":"vor","delay-in-days":72,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002332","name":"Semmelweis University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002332","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Ranking athletes by their performance in competitions and tournaments is common in every popular sport and has significant benefits that contribute to both the organization and strategic aspects of competitions. Although rankings are perhaps the most concise and most straightforward representation of the relative strength among the competitors, beyond this one-dimensional characterization, it is also possible to capture the relationships between athletes in greater detail. Following this approach, our study examines the networks between athletes in individual sports such as fencing and tennis, where the nodes are associated with the contestants and the edges are directed from the winner to the loser. We demonstrate that the connections formed through matches arrange themselves into a time-evolving hierarchy, with the top players positioned at its apex. The structure of the resulting networks exhibits detectable differences depending on whether they are constructed purely from round-robin data or from purely elimination-style tournaments. We find that although elimination tournaments lead to networks with strong hierarchical networks due to their organisational concept (structural hierarchy), the dominance differences between players (competing hierarchy) are less effective in this format, which is manifested in the increased probability of circular win-loss situations (cycles). The position within the hierarchy, along with other network metrics, can be used to predict match outcomes. In the systems studied, these methods provide predictions with an accuracy comparable to that of forecasts based on official sports ranking points or the Elo rating system. A deeper understanding of the delicate aspects of pairwise contest networks enhances our ability to model, predict, and optimise the behaviour of many complex systems, whether in sports tournaments, social interactions, or other competitive environments.<\/jats:p>","DOI":"10.1038\/s41598-026-53459-7","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T07:42:36Z","timestamp":1780299756000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchy and ranking in fencing and tennis"],"prefix":"10.1038","volume":"16","author":[{"given":"Bogd\u00e1n","family":"Asztalos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boldizs\u00e1r","family":"Bal\u00e1zs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gergely","family":"Palla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Vicsek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"key":"53459_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R. & Barab\u00e1si, A.-L. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397. https:\/\/doi.org\/10.1103\/RevModPhys.74.47 (2002).","journal-title":"Rev. Mod. Phys."},{"key":"53459_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198515906.001.0001","volume-title":"Evolution of Networks: From Biological Nets to the Internet and WWW","author":"SN Dorogovtsev","year":"2003","unstructured":"Dorogovtsev, S. N. & Mendes, J. F. F. Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, 2003)."},{"key":"53459_CR3","volume-title":"The Structure and Dynamics of Networks","author":"M Newman","year":"2006","unstructured":"Newman, M., Barab\u00e1si, A.-L. & Watts, D. J. The Structure and Dynamics of Networks (Princeton University Press, 2006)."},{"key":"53459_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P. & Saram\u00e4ki, J. Temporal networks. Phys. Rep. 519, 97\u2013125. https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001 (2012).","journal-title":"Phys. Rep."},{"key":"53459_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791383","volume-title":"Dynamical Processes on Complex Networks","author":"A Barrat","year":"2008","unstructured":"Barrat, A., Barth\u00e9lemy, M. & Vespignani, A. Dynamical Processes on Complex Networks (Cambridge University Press, 2008)."},{"key":"53459_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.ejor.2015.06.069","volume":"248","author":"S Boz\u00f3ki","year":"2016","unstructured":"Boz\u00f3ki, S., Csat\u00f3, L. & Temesi, J. An application of incomplete pairwise comparison matrices for ranking top tennis players. Eur. J. Oper. Res. 248, 211\u2013218. https:\/\/doi.org\/10.1016\/j.ejor.2015.06.069 (2016).","journal-title":"Eur. J. Oper. Res."},{"key":"53459_CR7","doi-asserted-by":"publisher","first-page":"eaar8260","DOI":"10.1126\/sciadv.aar8260","volume":"4","author":"C De Bacco","year":"2018","unstructured":"De Bacco, C., Larremore, D. B. & Moore, C. A physical model for efficient ranking in networks. Sci. Adv. 4, eaar8260. https:\/\/doi.org\/10.1126\/sciadv.aar8260 (2018).","journal-title":"Sci. Adv."},{"key":"53459_CR8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0267541","volume":"17","author":"C Zappal\u00e0","year":"2022","unstructured":"Zappal\u00e0, C., Pluchino, A., Rapisarda, A., Biondo, A. E. & Sobkowicz, P. On the role of chance in fencing tournaments: an agent-based approach. PLoS ONE 17, e0267541. https:\/\/doi.org\/10.1371\/journal.pone.0267541 (2022).","journal-title":"PLoS ONE"},{"key":"53459_CR9","first-page":"1","volume":"24","author":"MEJ Newman","year":"2023","unstructured":"Newman, M. E. J. Efficient computation of rankings from pairwise comparisons. J. Mach. Learn. Res. 24, 1\u201325 (2023).","journal-title":"J. Mach. Learn. Res."},{"key":"53459_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2023.114088","volume":"176","author":"C Zappal\u00e0","year":"2023","unstructured":"Zappal\u00e0, C., Biondo, A. E., Pluchino, A. & Rapisarda, A. The paradox of talent: how chance affects success in tennis tournaments. Chaos Solitons Fractals 176, 114088. https:\/\/doi.org\/10.1016\/j.chaos.2023.114088 (2023).","journal-title":"Chaos Solitons Fractals"},{"key":"53459_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780190935467.001.0001","volume-title":"Ranking: The Unwritten Rules of the Social Game We All Play","author":"P \u00c9rdi","year":"2019","unstructured":"\u00c9rdi, P. Ranking: The Unwritten Rules of the Social Game We All Play (Oxford University Press, 2019)."},{"key":"53459_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1018928301345","volume":"80","author":"PY Chebotarev","year":"1998","unstructured":"Chebotarev, P. Y. & Shamis, E. Characterizations of scoring methods for preference aggregation. Ann. Oper. Res. 80, 299\u2013332. https:\/\/doi.org\/10.1023\/A:1018928301345 (1998).","journal-title":"Ann. Oper. Res."},{"key":"53459_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00355-013-0726-2","volume":"42","author":"J Gonz\u00e1lez-D\u00edaz","year":"2014","unstructured":"Gonz\u00e1lez-D\u00edaz, J., Hendrickx, R. & Lohmann, E. Paired comparisons analysis: an axiomatic approach to ranking methods. Soc. Choice Welfare 42, 139\u2013169. https:\/\/doi.org\/10.1007\/s00355-013-0726-2 (2014).","journal-title":"Soc. Choice Welfare"},{"key":"53459_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1613\/jair.2306","volume":"31","author":"A Altman","year":"2008","unstructured":"Altman, A. & Tennenholtz, M. Axiomatic foundations for ranking systems. J. Artif. Intell. Res. 31, 473\u2013495. https:\/\/doi.org\/10.1613\/jair.2306 (2008).","journal-title":"J. Artif. Intell. Res."},{"key":"53459_CR15","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10100-018-0572-5","volume":"27","author":"L Csat\u00f3","year":"2019","unstructured":"Csat\u00f3, L. An impossibility theorem for paired comparisons. Cent. Eur. J. Oper. Res. 27, 497\u2013514. https:\/\/doi.org\/10.1007\/s10100-018-0572-5 (2019).","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"53459_CR16","doi-asserted-by":"publisher","first-page":"1940002","DOI":"10.1142\/S0219198919400024","volume":"21","author":"L Csat\u00f3","year":"2019","unstructured":"Csat\u00f3, L. Some impossibilities of ranking in generalized tournaments. Int. Game Theory Rev. 21, 1940002. https:\/\/doi.org\/10.1142\/S0219198919400024 (2019).","journal-title":"Int. Game Theory Rev."},{"key":"53459_CR17","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841677","volume-title":"Who\u2019s # 1?: The Science of Rating and Ranking","author":"AN Langville","year":"2012","unstructured":"Langville, A. N. & Meyer, C. D. Who\u2019s # 1?: The Science of Rating and Ranking (Princeton University Press, 2012)."},{"key":"53459_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset, A., Moore, C. & Newman, M. E. J. Hierarchical structure and the prediction of missing links in networks. Nature 453, 98\u2013101. https:\/\/doi.org\/10.1038\/nature06830 (2008).","journal-title":"Nature"},{"key":"53459_CR19","volume-title":"Hierarchy in Natural and Social Sciences, vol. 3 of Methodos Series","author":"D Pumain","year":"2005","unstructured":"Pumain, D. Hierarchy in Natural and Social Sciences, vol. 3 of Methodos Series (Springer, 2005)."},{"key":"53459_CR20","volume-title":"Why we live in hierarchies?: A quantitative treatise","author":"A Zafeiris","year":"2017","unstructured":"Zafeiris, A. & Vicsek, T. Why we live in hierarchies?: A quantitative treatise (Springer, 2017)."},{"key":"53459_CR21","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1186\/1471-2105-5-199","volume":"5","author":"H-W Ma","year":"2004","unstructured":"Ma, H.-W., Buer, J. & Zeng, A.-P. Hierarchical structure and modules in the Escherichia coli transcriptional regulatory network revealed by a new top-down approach. BMC Bioinform. 5, 199. https:\/\/doi.org\/10.1186\/1471-2105-5-199 (2004).","journal-title":"BMC Bioinform."},{"key":"53459_CR22","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1009327","volume":"17","author":"G Palla","year":"2021","unstructured":"Palla, G. et al. Hierarchy and control of ageing-related methylation networks. PLoS Comput. Biol. 17, e1009327. https:\/\/doi.org\/10.1371\/journal.pcbi.1009327 (2021).","journal-title":"PLoS Comput. Biol."},{"key":"53459_CR23","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1038\/nature08891","volume":"464","author":"M Nagy","year":"2010","unstructured":"Nagy, M., \u00c1kos, Z., Biro, D. & Vicsek, T. Hierarchical group dynamics in pigeon flocks. Nature 464, 890\u2013893. https:\/\/doi.org\/10.1038\/nature08891 (2010).","journal-title":"Nature"},{"key":"53459_CR24","doi-asserted-by":"publisher","first-page":"13049","DOI":"10.1073\/pnas.1305552110","volume":"110","author":"M Nagy","year":"2013","unstructured":"Nagy, M. et al. Context-dependent hierarchies in pigeons. Proc. Natl. Acad. Sci. 110, 13049\u201313054. https:\/\/doi.org\/10.1073\/pnas.1305552110 (2013).","journal-title":"Proc. Natl. Acad. Sci."},{"key":"53459_CR25","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/s10955-014-1131-7","volume":"158","author":"K Ozog\u00e1ny","year":"2015","unstructured":"Ozog\u00e1ny, K. & Vicsek, T. Modeling the emergence of modular leadership hierarchy during the collective motion of herds made of harems. J. Stat. l Phys. 158, 628\u2013646. https:\/\/doi.org\/10.1007\/s10955-014-1131-7 (2015).","journal-title":"J. Stat. l Phys."},{"key":"53459_CR26","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0165728","volume":"11","author":"G Tib\u00e9ly","year":"2016","unstructured":"Tib\u00e9ly, G., Sousa-Rodrigues, D., Pollner, P. & Palla, G. Comparing the hierarchy of keywords in on-line news portals. PLoS ONE 11, e0165728. https:\/\/doi.org\/10.1371\/journal.pone.0165728 (2016).","journal-title":"PLoS ONE"},{"key":"53459_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1057\/palcomms.2015.16","volume":"1","author":"G Palla","year":"2015","unstructured":"Palla, G., Tib\u00e9ly, G., Mones, E., Pollner, P. & Vicsek, T. Hierarchical networks of scientific journals. Palgrave Commun. 1, 1\u20139. https:\/\/doi.org\/10.1057\/palcomms.2015.16 (2015).","journal-title":"Palgrave Commun."},{"key":"53459_CR28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0220648","volume":"14","author":"SG Balogh","year":"2019","unstructured":"Balogh, S. G., Zagyva, D., Pollner, P. & Palla, G. Time evolution of the hierarchical networks between PubMed MeSH terms. PLoS ONE 14, e0220648. https:\/\/doi.org\/10.1371\/journal.pone.0220648 (2019).","journal-title":"PLoS ONE"},{"key":"53459_CR29","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0022-5193(85)80271-X","volume":"116","author":"H Hirata","year":"1985","unstructured":"Hirata, H. & Ulanowicz, R. E. Information theoretical analysis of the aggregation and hierarchical structure of ecological networks. J. Theor. Biol. 116, 321\u2013341. https:\/\/doi.org\/10.1016\/S0022-5193(85)80271-X (1985).","journal-title":"J. Theor. Biol."},{"key":"53459_CR30","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0140-1750(88)90066-8","volume":"11","author":"JS Wickens","year":"1988","unstructured":"Wickens, J. S. & Ulanowicz, R. E. On quantifying hierarchical connections in ecology. J. Socioal Biol. Struct. 11, 369\u2013377. https:\/\/doi.org\/10.1016\/0140-1750(88)90066-8 (1988).","journal-title":"J. Socioal Biol. Struct."},{"key":"53459_CR31","volume-title":"Unfinished Synthesis: Biological Hierarchies and Modern Evolutionary Thought","author":"N Eldredge","year":"1985","unstructured":"Eldredge, N. Unfinished Synthesis: Biological Hierarchies and Modern Evolutionary Thought (Oxford University Press, 1985)."},{"key":"53459_CR32","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1666\/0094-8373(2001)027","volume":"27","author":"DW McShea","year":"2001","unstructured":"McShea, D. W. The hierarchical structure of organisms: a scale and documentation of a trend in the maximum. Paleobiology 27, 405\u2013423. https:\/\/doi.org\/10.1666\/0094-8373(2001)027 (2001).","journal-title":"Paleobiology"},{"key":"53459_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1004829","volume":"12","author":"H Mengistu","year":"2016","unstructured":"Mengistu, H., Huizinga, J., Mouret, J.-B. & Clune, J. The evolutionary origins of hierarchy. PLoS Comput. Biol. 12, 1\u201323. https:\/\/doi.org\/10.1371\/journal.pcbi.1004829 (2016).","journal-title":"PLoS Comput. Biol."},{"key":"53459_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.178702","volume":"92","author":"A Trusina","year":"2004","unstructured":"Trusina, A., Maslov, S., Minnhagen, P. & Sneppen, K. Hierarchy measures in complex networks. Phys. Rev. Lett. 92, 178702. https:\/\/doi.org\/10.1103\/PhysRevLett.92.178702 (2004).","journal-title":"Phys. Rev. Lett."},{"key":"53459_CR35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033799","volume":"7","author":"E Mones","year":"2012","unstructured":"Mones, E., Vicsek, L. & Vicsek, T. Hierarchy measure for complex networks. PLoS ONE 7, e33799. https:\/\/doi.org\/10.1371\/journal.pone.0033799 (2012).","journal-title":"PLoS ONE"},{"key":"53459_CR36","doi-asserted-by":"publisher","first-page":"13316","DOI":"10.1073\/pnas.1300832110","volume":"110","author":"B Corominas-Murtra","year":"2013","unstructured":"Corominas-Murtra, B., Go\u00f1i, J., Sol\u00e9, R. V. & Rodr\u00edguez-Caso, C. On the origins of hierarchy in complex networks. Proc. Nat. Acad. Sci. 110, 13316\u201313321. https:\/\/doi.org\/10.1073\/pnas.1300832110 (2013).","journal-title":"Proc. Nat. Acad. Sci."},{"key":"53459_CR37","doi-asserted-by":"publisher","first-page":"17994","DOI":"10.1038\/srep17994","volume":"5","author":"D Cz\u00e9gel","year":"2015","unstructured":"Cz\u00e9gel, D. & Palla, G. Random walk hierarchy measure: What is more hierarchical, a chain, a tree or a star?. Sci. Rep. 5, 17994. https:\/\/doi.org\/10.1038\/srep17994 (2015).","journal-title":"Sci. Rep."},{"key":"53459_CR38","doi-asserted-by":"publisher","unstructured":"Gupte, M., Shankar, P., Li, J., Muthukrishnan, S. & Iftode, L. Finding hierarchy in directed online social networks. In Proceedings of the 20th International Conference on World Wide Web 557\u2013566. https:\/\/doi.org\/10.1145\/1963405.1963484(Association for Computing Machinery) (2011).","DOI":"10.1145\/1963405.1963484"},{"key":"53459_CR39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0191604","volume":"13","author":"E Letizia","year":"2018","unstructured":"Letizia, E., Barucca, P. & Lillo, F. Resolution of ranking hierarchies in directed networks. PLoS ONE 13, e0191604. https:\/\/doi.org\/10.1371\/journal.pone.0191604 (2018).","journal-title":"PLoS ONE"},{"key":"53459_CR40","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1515\/jqas-2013-0101","volume":"10","author":"D Irons","year":"2014","unstructured":"Irons, D., Buckley, S. & Paulden, T. Developing an improved tennis ranking system. J. Quant. Anal. Sports 10, 109\u2013118. https:\/\/doi.org\/10.1515\/jqas-2013-0101 (2014).","journal-title":"J. Quant. Anal. Sports"},{"key":"53459_CR41","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1515\/jqas-2015-0059","volume":"12","author":"KS Ann","year":"2016","unstructured":"Ann, K. S. Searching for the goat of tennis win prediction. J. Quant. Anal. Sports 12, 127\u2013138. https:\/\/doi.org\/10.1515\/jqas-2015-0059 (2016).","journal-title":"J. Quant. Anal. Sports"},{"key":"53459_CR42","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1515\/jqas-2019-0110","volume":"17","author":"LV Williams","year":"2019","unstructured":"Williams, L. V., Liu, C., Dixon, L. & Gerrard, H. How well do Elo-based ratings predict professional tennis matches?. J. Quant. Anal. Sports 17, 91\u2013105. https:\/\/doi.org\/10.1515\/jqas-2019-0110 (2019).","journal-title":"J. Quant. Anal. Sports"},{"key":"53459_CR43","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3233\/JSA-200463","volume":"7","author":"S Wilkens","year":"2021","unstructured":"Wilkens, S. Sports prediction and betting models in the machine learning age: the case of tennis. J. Sports Anal. 7, 99\u2013117. https:\/\/doi.org\/10.3233\/JSA-200463 (2021).","journal-title":"J. Sports Anal."},{"key":"53459_CR44","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2021.04.011","volume":"297","author":"G Angelini","year":"2022","unstructured":"Angelini, G., Candila, V. & De Angelis, L. Weighted Elo rating for tennis match predictions. Eur. J. Oper. Res. 297, 120\u2013132. https:\/\/doi.org\/10.1016\/j.ejor.2021.04.011 (2022).","journal-title":"Eur. J. Oper. Res."},{"key":"53459_CR45","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10479-022-04594-7","volume":"325","author":"A Arcagni","year":"2023","unstructured":"Arcagni, A., Candila, V. & Grassi, R. A new model for predicting the winner in tennis based on the eigenvector centrality. Ann. Oper. Res. 325, 615\u2013632. https:\/\/doi.org\/10.1007\/s10479-022-04594-7 (2023).","journal-title":"Ann. Oper. Res."},{"key":"53459_CR46","doi-asserted-by":"publisher","unstructured":"Filippo, R. Who Is the Best Player Ever? A Complex Network Analysis of the History of Professional Tennis PLoS ONE 6(2) e17249. https:\/\/doi.org\/10.1371\/journal.pone.0017249 (2011).","DOI":"10.1371\/journal.pone.0017249"},{"key":"53459_CR47","doi-asserted-by":"publisher","unstructured":"Gorgi, P. & Koopman, S. J. R., Lit (2019) (2019) The Analysis and Forecasting of Tennis Matches by using a High Dimensional Dynamic Model Summary Journal of the Royal Statistical Society Series A: Statistics in Society 182(4) 1393\u20131409. https:\/\/doi.org\/10.1111\/rssa.12464 (2019).","DOI":"10.1111\/rssa.12464"},{"issue":"4","key":"53459_CR48","doi-asserted-by":"publisher","first-page":"e0266838","DOI":"10.1371\/journal.pone.0266838","volume":"17","author":"C Jack","year":"2022","unstructured":"Jack, C., Yue Elizabeth, P., Ming-Hui, C., Li-Chen, H. & Hsiao A study of forecasting tennis matches via the Glicko model. PLOS ONE. 17 (4), e0266838. https:\/\/doi.org\/10.1371\/journal.pone.0266838 (2022).","journal-title":"PLOS ONE"},{"key":"53459_CR49","unstructured":"Sackmann, J. ATP Tennis Data. https:\/\/github.com\/JeffSackmann\/tennis_atp (2025). Accessed: 01 Jan 2025."},{"key":"53459_CR50","unstructured":"Sackmann, J. WTA Tennis Data. https:\/\/github.com\/JeffSackmann\/tennis_wta (2025)."},{"key":"53459_CR51","unstructured":"Post-Michaelsen, A. FIE Fencing Data. https:\/\/github.com\/amichaelsen\/fie-fencing-dataset (2025)."},{"key":"53459_CR52","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1177\/15270025241264235","volume":"25","author":"JC van Ours","year":"2024","unstructured":"van Ours, J. C. Nontransitive patterns in long-term football rivalries. J. Sports Econ. 25, 802\u2013826. https:\/\/doi.org\/10.1177\/15270025241264235 (2024).","journal-title":"J. Sports Econ."},{"key":"53459_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.serev.2025.100051","volume":"10","author":"JC van Ours","year":"2025","unstructured":"van Ours, J. C. On bogey teams and circular triads: psychological factors in team performance. Sports Econ. Rev. 10, 100051. https:\/\/doi.org\/10.1016\/j.serev.2025.100051 (2025).","journal-title":"Sports Econ. Rev."},{"key":"53459_CR54","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/cplx.20368","volume":"16","author":"J Luo","year":"2011","unstructured":"Luo, J. & Magee, C. L. Detecting evolving patterns of self-organizing networks by flow hierarchy measurement. Complexity 16, 53\u201361. https:\/\/doi.org\/10.1002\/cplx.20368 (2011).","journal-title":"Complexity"},{"key":"53459_CR55","unstructured":"International Fencing Federation. Organisation Rules. https:\/\/static.fie.org\/uploads\/38\/190670-Organisation rules ang.pdf (2025)."},{"key":"53459_CR56","unstructured":"ATP Tour, Inc. Official Rulebook. https:\/\/www.atptour.com\/en\/corporate\/rulebook (2025)."},{"key":"53459_CR57","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.euroecorev.2017.09.006","volume":"100","author":"A Krumer","year":"2017","unstructured":"Krumer, A. & Lechner, M. First in first win: evidence on schedule effects in round-robin tournaments in mega-events. Eur. Econ. Rev. 100, 412\u2013427. https:\/\/doi.org\/10.1016\/j.euroecorev.2017.09.006 (2017).","journal-title":"Eur. Econ. Rev."},{"key":"53459_CR58","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/j.ejor.2021.02.006","volume":"294","author":"M Chater","year":"2021","unstructured":"Chater, M., Arrondel, L., Gayant, J.-P. & Laslier, J.-F. Fixing match-fixing: optimal schedules to promote competitiveness. Eur. J. Oper. Res. 294, 673\u2013683. https:\/\/doi.org\/10.1016\/j.ejor.2021.02.006 (2021).","journal-title":"Eur. J. Oper. Res."},{"key":"53459_CR59","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1111\/itor.13391","volume":"31","author":"L Csat\u00f3","year":"2024","unstructured":"Csat\u00f3, L., Molontay, R. & Pint\u00e9r, J. Tournament schedules and incentives in a double round-robin tournament with four teams. Int. Trans. Oper. Res. 31, 1486\u20131514. https:\/\/doi.org\/10.1111\/itor.13391 (2024).","journal-title":"Int. Trans. Oper. Res."},{"key":"53459_CR60","doi-asserted-by":"publisher","first-page":"376","DOI":"10.17226\/10735","volume-title":"Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers","author":"SP Borgatti","year":"2003","unstructured":"Borgatti, S. P. The key player problem. In Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers (eds Breiger, R. et al.) 376\u2013387 (National Academies Press, 2003). https:\/\/doi.org\/10.17226\/10735."},{"key":"53459_CR61","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1214\/aoms\/1177730977","volume":"17","author":"L Guttman","year":"1946","unstructured":"Guttman, L. An approach for quantifying paired comparisons and rank order. Ann. Math. Stat. 17, 144\u2013163. https:\/\/doi.org\/10.1214\/aoms\/1177730977 (1946).","journal-title":"Ann. Math. Stat."},{"key":"53459_CR62","unstructured":"Elo, A. E. The proposed USCF rating system, its development, theory, and applications. In Chess Life XXII 242\u2013247 (1967)."},{"key":"53459_CR63","volume-title":"The Rating of Chessplayers: Past and Present","author":"AE Elo","year":"1978","unstructured":"Elo, A. E. The Rating of Chessplayers: Past and Present (Arco, 1978)."},{"key":"53459_CR64","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1214\/17-STS628","volume":"32","author":"DJ Aldous","year":"2017","unstructured":"Aldous, D. J. Elo ratings and the sports model: A neglected topic in applied probability?. Stat. Sci. 32, 616\u2013629. https:\/\/doi.org\/10.1214\/17-STS628 (2017).","journal-title":"Stat. Sci."},{"key":"53459_CR65","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2023.104313","volume":"145","author":"DG de Pinho Zanco","year":"2024","unstructured":"de Pinho Zanco, D. G., Szczecinski, L., Kuhn, E. V. & Seara, R. Stochastic analysis of the Elo rating algorithm in round-robin tournaments. Digit. Signal Process. 145, 104313. https:\/\/doi.org\/10.1016\/j.dsp.2023.104313 (2024).","journal-title":"Digit. Signal Process."},{"key":"53459_CR66","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2025.2612140","author":"J Gerken","year":"2026","unstructured":"Gerken, J. et al. The issue of sparse networks in sports competitions: can Elo ratings efficiently compare football teams that never play a match?. J. Oper. Res. Soc. https:\/\/doi.org\/10.1080\/01605682.2025.2612140 (2026).","journal-title":"J. Oper. Res. Soc."},{"key":"53459_CR67","doi-asserted-by":"publisher","first-page":"324","DOI":"10.2307\/2334029","volume":"39","author":"RA Bradley","year":"1952","unstructured":"Bradley, R. A. & Terry, M. E. Rank analysis of incomplete block designs: I. The method of paired comparisons. Biometrika 39, 324\u2013345. https:\/\/doi.org\/10.2307\/2334029 (1952).","journal-title":"Biometrika"},{"key":"53459_CR68","unstructured":"Glickman, M. E. & Doan, T. The US Chess Rating System. https:\/\/new.uschess.org\/sites\/default\/files\/media\/documents\/the-us-chess-rating-system-revised-september-2020.pdf (2020)."},{"key":"53459_CR69","unstructured":"International Association Football Federation. Revision of the FIFA \/ Coca-Cola World Ranking. https:\/\/digitalhub.fifa.com\/m\/f99da4f73212220\/original\/edbm045h0udbwkqew35a-pdf.pdf (2018)."},{"key":"53459_CR70","doi-asserted-by":"publisher","first-page":"eadn2654","DOI":"10.1126\/sciadv.adn2654","volume":"10","author":"M Jerdee","year":"2024","unstructured":"Jerdee, M. & Newman, M. E. J. Luck, skill, and depth of competition in games and social hierarchies. Sci. Adv. 10, eadn2654. https:\/\/doi.org\/10.1126\/sciadv.adn2654 (2024).","journal-title":"Sci. Adv."},{"key":"53459_CR71","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S. & Page, L. The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30, 107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X (1998).","journal-title":"Comput. Netw. ISDN Syst."},{"key":"53459_CR72","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1057\/palgrave.jors.2600330","volume":"48","author":"T McGarry","year":"1997","unstructured":"McGarry, T. & Schutz, R. Efficacy of traditional sport tournament structures. J. Oper. Res. Soc. 48, 65\u201374. https:\/\/doi.org\/10.1057\/palgrave.jors.2600330 (1997).","journal-title":"J. Oper. Res. Soc."},{"key":"53459_CR73","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105821","volume":"144","author":"BR Sziklai","year":"2022","unstructured":"Sziklai, B. R., Bir\u00f3, P. & Csat\u00f3, L. The efficacy of tournament designs. Comput. Oper. Res. 144, 105821. https:\/\/doi.org\/10.1016\/j.cor.2022.105821 (2022).","journal-title":"Comput. Oper. Res."},{"key":"53459_CR74","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2024.10.044","volume":"324","author":"K Devriesere","year":"2025","unstructured":"Devriesere, K., Csat\u00f3, L. & Goossens, D. Tournament design: a review from an operational research perspective. Eur. J. Oper. Res. 324, 1\u201321. https:\/\/doi.org\/10.1016\/j.ejor.2024.10.044 (2025).","journal-title":"Eur. J. Oper. Res."},{"key":"53459_CR75","unstructured":"ATP Tour, Inc. PIF ATP Rankings. https:\/\/www.atptour.com\/en\/rankings\/singles (2025)."},{"key":"53459_CR76","unstructured":"WTA Tour, Inc. PIF WTA Rankings. https:\/\/www.wtatennis.com\/rankings\/singles (2025)."},{"key":"53459_CR77","unstructured":"International Fencing Federation. Athletes & Rankings. https:\/\/fie.org\/athletes (2025)."},{"key":"53459_CR78","first-page":"290","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P. & R\u00e9nyi, A. On random graphs. I. Publ. Math. 6, 290\u2013297 (1959).","journal-title":"Publ. Math."},{"key":"53459_CR79","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Comb. 1, 311\u2013316. https:\/\/doi.org\/10.1016\/S0195-6698(80)80030-8 (1980).","journal-title":"Eur. J. Comb."},{"key":"53459_CR80","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T. An introduction to ROC analysis. Pattern Recognit. Lett. 27, 861\u2013874. https:\/\/doi.org\/10.1016\/j.patrec.2005.10.010 (2006).","journal-title":"Pattern Recognit. Lett."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53459-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53459-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53459-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T13:03:26Z","timestamp":1786453406000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-53459-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,31]]},"references-count":80,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["53459"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-53459-7","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,31]]},"assertion":[{"value":"28 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"24877"}}