Skip to main content
SpringerLink
Log in

Constraint Programming and Machine Learning for Interactive Soccer Analysis

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 2016)

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

Included in the following conference series:

Abstract

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.

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

Access this chapter

Log in via an institution
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. Schwartz, B.L.: Possible winners in partially completed tournaments. SIAM Rev. 8(3), 302–308 (1966)

    Article  MATH  Google Scholar 

  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. Kern, W., Paulusma, D.: The new fifa rules are hard: complexity aspects of sports competitions. Discrete Appl. Math. 108(3), 317–323 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  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

    Chapter  Google Scholar 

  5. Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM J. Discrete Math. 14(2), 223–229 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Arbelaez, A., Hamadi, Y.: Exploiting weak dependencies in tree-based search. In: SAC 2009, pp. 1385–1391 (2009)

    Google Scholar 

  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. Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. ITOR 12(4), 375–386 (2005)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad del Valle, Cali, Colombia

    Robinson Duque & Juan Francisco Díaz

  2. Insight Centre for Data Analytics, University College Cork, Cork, Ireland

    Alejandro Arbelaez

Authors
  1. Robinson Duque
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Francisco Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alejandro Arbelaez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Robinson Duque .

Editor information

Editors and Affiliations

  1. Univ of Naples Federico II, Naples, Italy

    Paola Festa

  2. Thomas J. Wastson Research Center, Yorktown Heights, New York, USA

    Meinolf Sellmann

  3. Eindhoven University of Technology, Eindhoven, The Netherlands

    Joaquin Vanschoren

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Duque, R., Díaz, J.F., Arbelaez, A. (2016). Constraint Programming and Machine Learning for Interactive Soccer Analysis. In: Festa, P., Sellmann, M., Vanschoren, J. (eds) Learning and Intelligent Optimization. LION 2016. Lecture Notes in Computer Science(), vol 10079. Springer, Cham. https://doi.org/10.1007/978-3-319-50349-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50349-3_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50348-6

  • Online ISBN: 978-3-319-50349-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation