Abstract
The Circle Method is widely used in the field of sport scheduling to generate schedules for round-robin tournaments. The so-called carry-over effect value is a number that can be associated to each round-robin schedule; it represents a degree of balance of a schedule.
Here, we prove that, for an even number of teams, the Circle Method generates a schedule with maximum carry-over effect value, answering an open question.
This work is supported by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anderson, I.: Combinatorial Designs and Tournaments. Oxford University Press, Oxford (1997)
Anderson, I.: Balancing carry-over effects in tournaments. In: Holroyd, F., Quinn, K., Rowley, C., Webb, B. (eds.) Combinatorial Designs and Their Applications. Research Notes in Mathematics, vol. 403, pp. 1–16. CRC Press, Boca Raton (1997)
Froncek, D.: Scheduling a tournament. In: Gallian, J.A. (ed.) Mathematics and Sports. Dolciani Mathematical Expositions, vol. 43, pp. 203–216. Mathematical Association of America, Washington DC (2010)
De Werra, D.: Geography, games and graphs. Discrete Appl. Math. 2, 327–337 (1980)
De Werra, D.: Scheduling in sports. In: Hansen, P. (ed.) Studies on Graphs and Discrete Programming. Annals of Discrete Mathematics, vol. 11, pp. 381–395. North-Holland, Amsterdam (1981)
Goossens, D.R., Spieksma, F.C.R.: Soccer schedules in Europe: an overview. J. Sched. 15, 641–651 (2012)
Goossens, D.R., Spieksma, F.C.R.: The carry-over effect does not influence football results. J. Sports Econ. 13, 288–305 (2012)
Griggs, T., Rosa, A.: A tour of european soccer schedules, or testing the popularity of \(GK_{2n}\). Bull. Inst. Comb. Appl. 18, 65–68 (1996)
Januario, T., Urrutia, S., Ribeiro, C., de Werra, D.: A Tutorial on Edge Coloring in Graphs for Sports Scheduling. http://www2.ic.uff.br/~celso/artigos/ejor_single_file.pdf. Accessed 3 Nov 2015
Kendall, G., Knust, S., Ribeiro, C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37, 1–19 (2010)
Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191–204 (1847)
Lambrechts, E., Ficker, A.M.C., Goossens, D.R., Spieksma, F.C.R.: Round-robin tournaments generated by the circle method have maximum carry-over. Research report, KBI_1603, KU Leuven
Miyashiro, R., Matsui, T.: Minimizing the carry-over effects value in a round-robin tournament. In: Burke, E.K., Rudová, H. (eds.) Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, pp. 460–463 (2006)
Russell, K.G.: Balancing carry-over effects in round robin tournaments. Biometrika 67(1), 127–131 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Lambrechts, E., Ficker, A.M.C., Goossens, D.R., Spieksma, F.C.R. (2016). Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over. In: Louveaux, Q., Skutella, M. (eds) Integer Programming and Combinatorial Optimization. IPCO 2016. Lecture Notes in Computer Science(), vol 9682. Springer, Cham. https://doi.org/10.1007/978-3-319-33461-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-33461-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33460-8
Online ISBN: 978-3-319-33461-5
eBook Packages: Computer ScienceComputer Science (R0)