Competitive Game Table and the Optimization Algorithm

In this chapter, a new agent-based noncooperative strategic dynamic game is proposed, called the competitive game table (CGT), to simulate the real-world battles and predict the results by considering the interactions and interchanging data during the battles. As a symmetric game, CGT is developed to embrace the battles between two players. The game is grounded on 12 rules, which conduct the game to predict the strategic posture of players in 4 scenarios, including the aggressive, competitive, conservative, and defensive postures. The game also offers a metaheuristic optimization algorithm called the competitive game optimization (CGO) algorithm to optimize the player’s strategic position in the battles. The main objective of this study is to propose a comprehensive paradigm for modeling, predicting, and optimizing players’ behavior during and after battles. In addition, this chapter is focused on modeling the market’s competition by CGT to unearth the competitors’ behavioral patterns in a marketplace in order to determine the most efficient strategies. The game is also compared with the Colonel Blotto game to illustrate its advantages.