Skip to main content

Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9682))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anderson, I.: Combinatorial Designs and Tournaments. Oxford University Press, Oxford (1997)

    MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. De Werra, D.: Geography, games and graphs. Discrete Appl. Math. 2, 327–337 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Goossens, D.R., Spieksma, F.C.R.: Soccer schedules in Europe: an overview. J. Sched. 15, 641–651 (2012)

    Article  Google Scholar 

  7. Goossens, D.R., Spieksma, F.C.R.: The carry-over effect does not influence football results. J. Sports Econ. 13, 288–305 (2012)

    Article  Google Scholar 

  8. 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)

    MathSciNet  MATH  Google Scholar 

  9. 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

  10. Kendall, G., Knust, S., Ribeiro, C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37, 1–19 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191–204 (1847)

    Google Scholar 

  12. 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

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Russell, K.G.: Balancing carry-over effects in round robin tournaments. Biometrika 67(1), 127–131 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Annette M. C. Ficker .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics