A new game theory algorithm simulates soccer matches: Reducing
complexity to its irreducible essence
Alessandro Ferrarini
Department of Evolutionary and Functional Biology, University of Parma, Via G. Saragat 4, I-43100 Parma, Italy
Selforganizology
ISSN 2***-****
http://www.iaees.org/publications/journals/selforganizology/online-version.asp
2014
1
3-4
211
218
International Academy of Ecology and Environmental Sciences
Hong Kong
9 November 2014
12 November 2014
1 December 2014
complexity
game theory
iteration, simulation
soccer
sport event
stochasticity
How much complex is a human event like a soccer match? How much difficult is to predict its result? Can we disentangle the complexity behind such event? In this work, I state that the use of multiagent systems to simulate soccer events is improper: too many possible space-time configurations are possible, and the resulting complexity is unimaginable. A proper way to simulate such complex event is to turn its complexity into its irreducible essence. When such irreducible essence is tamed, stochasticity and iteration can then be added. I describe here in outline a math algorithm, named Soccer-Decoder and implemented through the software Soccer-Lab, that is based on game theory and differential calculus and that exactly does this: 1) it turns the complexity of a soccer match into its irreducible and structural essence, 2) it simulates soccer matches by adding stochasticity and iteration to such structural essence. An illustrative example is given. The philosophy on the underside of Soccer-Decoder is that even very complex real world events, when transformed into their irreducible essence, can be understood and predicted.
DOI 10.0000/issn-2***-****-selforganizology-2014-v1-0009
http://www.iaees.org/publications/journals/selforganizology/articles/2014-1(3-4)/a-new-game-theory-algorithm-simulates-soccer-matches.pdf