Arturo Yee, Matías Alvarado, Germinal Cocho



Team Formation and Selection of Strategies for Computer Simulations of Baseball Gaming

pdf PDF


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.


Baseball gaming, team formation, Hungarian method, strategic choices, Nash equilibrium, Pareto efficiency


[1] Britz SS, Maltitz MJv., Application of the Hungarian Algorithm in Baseball Team Selection, Publishing University of the Free State, 2012. [1] Britz SS, Maltitz MJv., Application of the Hungarian Algorithm in Baseball Team Selection, Publishing University of the Free State, 2012. 

[2] Thomas SJ, Swanik CB, Higginson JS, Kaminski TW, Swanik KA, Kelly Iv JD, et al. Neuromuscular and stiffness adaptations in division I collegiate baseball players, Journal of Electromyography and Kinesiology, Vol. 3, No. 1, 2013, pp. 102-9. 

[3] Kelly JD, Reason and magic in the country of baseball, The International Journal of the History of Sport, Vol. 28, No. 17, 2011, pp. 2491-505. 

[4] Chen W-C, Johnson AL. The dynamics of performance space of Major League Baseball pitchers 1871–2006. Annals of Opereation Research, Vol. 181, No. 1, 2010, pp. 287-302. 

[5] Alvarado M, Rendón AY., Nash equilibrium for collective strategic reasoning, Expert Systems with Applications, Vol. 3, No. 15, 2012, pp.12014-25. 

[6] Galuszka A, Swierniak A., Non-cooperative game approach to multi-robot planning, International Journal of Applied Mathematics and Computer Science, Vol. 15, No. 3, 2005, pp. 359-67. 

[7] Hubalovsky S., Modeling and Computer Simulation of Real Process – Solution of Mastermind Board Game, International Journal of Mathematics and Computer Simulation, Vol. 6, No. 1, 2012, pp. 107-18. 

[8] Yee A, Alvarado M., Methodology for the Modeling of Multi-Player Games, Proceedings of the 18th International Conference on Computers (part of CSCC '14), Santorini Island, Greece, July 17-21, 2014, pp. 353 - 8. 

[9] Karpowicz MP., Nash equilibrium design and price-based coordination in hierarchical systems, International Journal of Applied Mathematics and Computer Science, Vol. 22, No. 4, 2012, pp. 951-69. 

[10] Al-Rabadi AN., Qudits representations and computations of n-player many-valued quantum games, Applied Mathematics and Computation, Vol. 175, No. 1, 2006, pp. 691- 714. 

[11] Chukwu EN, Cooperation and competition in modeling the dynamics of gross-domestic products of nations, Applied Mathematics and Computation, Vol. 163, No. 2, 2005, pp. 991- 1021. 

[12] Clempner J, Poznyak A., Convergence method, properties and computational complexity for Lyapunov games, International Journal of Applied Mathematics and Computer Science, Vol. 21, No. 2, 2011, pp. 349-61. 

[13] Lewis HF, Sexton TR., Network DEA: efficiency analysis of organizations with complex internal structure, Computer and Operations Research, Vol. 31, No. 9, 2004, pp. 1365-410. 

[14] Kuhn HW., The Hungarian method for the assignment problem, Naval Res Logist Quart, Vol. 2, No. 1, 1955, pp. 83-97. 

[15] Munkres J, Algorithms for the Assignment and Transportation Problems, Journal of the Society for Industrial and Applied Mathematics, Vol. 5, No.1, 1957, pp.32-8. 

[16] Kuhn HW. A tale of three eras: The discovery and rediscovery of the Hungarian Method. European Journal of Operation Research. Vol. 219, No. 3, 2012, pp. 641-51. 

[17] Bjarkman PC., Diamonds Around the Globe, The Encyclopedia of International Baseball. Westport, CT, Publishing Greenwood Press, 2005. 

[18] Bradbury JC., The Baseball Economist: The Real Game Exposed, New York, NY, Publishing The Penguin Group, 2008. 

[19] Dütting P, Henzinger M, Weber I., Sponsored search, market equilibria, and the Hungarian Method, Information Processing Letters, Vol. 113, No. 3, 2013, pp. 67-73. 

[20] Goldberger J, Tassa T., A hierarchical clustering algorithm based on the Hungarian method, Pattern Recognition Letters, Vol. 29, No. 11, 2008, pp. 1632-8. 

[21] Chin-Jung H., Integrate the Hungarian Method and Genetic Algorithm to Solve the Shortest Distance Problem, Digital Manufacturing and Automation (ICDMA), 2012, pp. 496-9. 

[22] Tamura S, Kodera Y, Taniguchi S, Yanase T., Feasibility of Hungarian Algorithm Based Scheduling, IEEE International Conference on Systems, Man and Cybernetics (SMC 2010) 2010, pp. 1185-90. 

[23] Nash J., Non-Cooperative Games, The annals of Mathematics, Vol. 54, No. 2, 1951, pp. 286- 95. 

[24] Miettinen K., Nonlinear Multiobjective Optimization, Publishing Springer US, 1998. 

[25] Pareto V., Cours d'économie politique. F Rouge Lausanne. 1896;1-2. 

[26] Février P, Linnemer L,. Equilibrium selection: Payoff or risk dominance?: The case of the “weakest link”, Journal of Economic Behaviour Organization, Vol. 60, No. 2, 2006, pp. 164-81. 

[27] Clark K, Kay S, Sefton M., When are Nash equilibria self-enforcing? An experimental analysis, International Journal of Game Theor, Vol. 29, No. 4,. 2001, pp. 495-515. 

[28] Li J-F, Chen Y, Cui X-S,. The strategy based on game theory for cross-organizational business process reengineering in supply chain, W Trans on Comp, Vol. 7, No. 6, 2008, pp. 579-88. 

[29] Gai L, Song Y., A Lazy Bureaucrat Scheduling Game, W Trans on Math, Vol. 12, No. 4, 2013, pp. 385 - 93. 

[30] Roemer JE., Kantian Optimization, Social Ethos, and Pareto Efficiency, Cowles Foundation Discussion Paper No 1854 2012. 

[31] Gale D, Shapley LS., College Admissions and the Stability of Marriage. The American Mathematical Monthly, Vol. 69, No. 1, 1962, pp. 9-15. 

[32] Lindsey GR, An Investigation of Strategies in Baseball, Journal of Operation Research, Vol. 11, No. 4, 1963, pp. 477-501. 

[33] Williams T., Winning Strategies for Offense and Defense, Publishing Baseball’s Best, 2005. Arturo Yee et al. 

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