Abstract: In computer simulation of baseball gaming, we deal with selection of strategies by applying Nash equilibrium (NE) and Pareto efficiency (PE). NE and PE, each supports that selection of strategies is in a non-cooperative or a cooperative aim, respectively. During a baseball game, each one of these aims has a relevant meaning on the manager’s decision making, as we showed from the results of computer simulation. In order to apply these techniques for making strategic choices, the utility function for the strategy profiles selection is constructed based on empirical baseball data. A complementary issue on baseball computer simulation is the team formation: By applying the Hungarian method (HM) guarantees that the selection of each player is done by regarding her contribution to the team’s improved performance, as an assembling of abilities, beyond his individual qualification [1]. The results from computer simulation tests hint that the use of HM for team formation combined with the use of NE or PE for the selection of strategies, lead to the team’s enhanced performance in a match. Furthermore, the performance of teams diminishes when only use NE or PE without using the HM.
Keywords: Baseball gaming, team formation, Hungarian method, strategic choices, Nash equilibrium, Pareto efficiency
Cite this paper
Arturo Yee, Matías Alvarado, Germinal Cocho. (2016) Team Formation and Selection of Strategies for Computer Simulations of Baseball Gaming. Mathematical and Computational Methods, 1 , 330-344

Copyright © 2016 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution License 4.0


