Constraint Programming and Machine Learning for Interactive Soccer Analysis

  • Robinson Duque
  • Juan Francisco Díaz
  • Alejandro Arbelaez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10079)


A soccer competition consists of n teams playing against each other in a league or tournament system, according to a single or double round-robin schedule. These competitions offer an excellent opportunity to model interesting problems related to questions that soccer fans frequently ask about their favourite teams. For instance, at some stage of the competition, fans might be interested in determining whether a given team still has chances of winning the competition (i.e., finishing first in a league or being within the first k teams in a tournament to qualify to the playoff). This problem relates to the elimination problem, which is NP-complete for the actual FIFA pointing rule system (0, 1, 3), zero point to a loss, one point to a tie, and three points to a win. In this paper, we combine constraint programming with machine learning to model a general soccer scenario in a real-time application.


  1. 1.
    Schwartz, B.L.: Possible winners in partially completed tournaments. SIAM Rev. 8(3), 302–308 (1966)CrossRefzbMATHGoogle Scholar
  2. 2.
    Hoffman, A., Rivlin, T.: When is a team mathematically eliminated? In: Princeton Symposium on Mathematical Programming, pp. 391–401. Princeton, NJ (1967)Google Scholar
  3. 3.
    Kern, W., Paulusma, D.: The new fifa rules are hard: complexity aspects of sports competitions. Discrete Appl. Math. 108(3), 317–323 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bernholt, T., Gülich, A., Hofmeister, T., Schmitt, N.: Football elimination is hard to decide under the 3-point-rule. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 410–418. Springer, Heidelberg (1999). doi: 10.1007/3-540-48340-3_37 CrossRefGoogle Scholar
  5. 5.
    Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM J. Discrete Math. 14(2), 223–229 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Arbelaez, A., Hamadi, Y.: Exploiting weak dependencies in tree-based search. In: SAC 2009, pp. 1385–1391 (2009)Google Scholar
  7. 7.
    Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. In: IJCAI 1979, San Francisco, CA, USA, pp. 356–364 (1979)Google Scholar
  8. 8.
    Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. ITOR 12(4), 375–386 (2005)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Robinson Duque
    • 1
  • Juan Francisco Díaz
    • 1
  • Alejandro Arbelaez
    • 2
  1. 1.Universidad del ValleCaliColombia
  2. 2.Insight Centre for Data AnalyticsUniversity College CorkCorkIreland

Personalised recommendations