Abstract
Soccer is one of the most popular sports in the world with millions of fans that usually raise interesting questions when the competition is partially completed. One interesting question relates to the elimination problem which consists in checking at some stage of the competition if a team i still has a theoretical chance to become the champion. Some other interesting problems from literature are the guaranteed qualification problem, the possible qualification problem, the score vector problem, promotion and relegation. These problems are NP-complete for the actual FIFA pointing rule system (0 points-loss, 1 point-tie, 3 points-win). SABIO is an online platform that helps users discover information related to soccer by letting them formulate questions in form of constraints and go beyond the classical soccer computational problems. In the paper we considerably improve the performance of an existing CP model and combine the use of MIP and CP to answer general soccer queries in a real-time application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schwartz, B.L.: Possible winners in partially completed tournaments. SIAM Rev. 8(3), 302–308 (1966)
Hoffman, A., Rivlin, T.: When is a team “mathematically” eliminated? In: Princeton Symposium on Mathematical Programming, pp. 391–401. Princeton, NJ (1967)
Kern, W., Paulusma, D.: The new FIFA rules are hard: complexity aspects of sports competitions. Discrete Appl. Math. 108(3), 317–323 (2001)
Bernholt, T., Gälich, A., Hofmeister, T., Schmitt, N.: Football elimination is hard to decide under the 3-point-rule. In: MFCS, pp. 410–418 (1999)
Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM J. Discrete Math. 14(2), 223–229 (2001)
Kern, W., Paulusma, D.: The computational complexity of the elimination problem in generalized sports competitions. Discrete Optim. 1(2), 205–214 (2004)
Pálvölgyi, D.: Deciding soccer scores and partial orientations of graphs. Acta Univ. Sapientiae 1(1), 35–42 (2009)
Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. Int. Trans. Oper. Res. 12(4), 375–386 (2005)
Duque, R., Díaz, J.F., Arbelaez, A.: Constraint programming and machine learning for interactive soccer analysis. In: LION 10 (2016, to appear)
Arbelaez, A., Hamadi, Y.: Exploiting weak dependencies in tree-based search. In: SAC 2009, pp. 1385–1391 (2009)
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)
Borrett, J., Tsang, E.P., Walsh, N.R.: Adaptive constraint satisfaction: the quickest first principle. In: European Conference on Artificial Intelligence (1996)
Acknowledgements
We would like to thank Luis F. Vargas, María A. Cruz and Carlos Martínez for developing early versions of the CP model under the supervision of Juan F. Díaz. Robinson Duque is supported by Colciencias under the PhD scholarship program. Alejandro Arbelaez is supported by SFI Grant No. 10/CE/I1853.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
1 Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Duque, R., Díaz, J.F., Arbelaez, A. (2016). SABIO: An Implementation of MIP and CP for Interactive Soccer Queries. In: Rueher, M. (eds) Principles and Practice of Constraint Programming. CP 2016. Lecture Notes in Computer Science(), vol 9892. Springer, Cham. https://doi.org/10.1007/978-3-319-44953-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-44953-1_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44952-4
Online ISBN: 978-3-319-44953-1
eBook Packages: Computer ScienceComputer Science (R0)