Interpreting the Iterated Dilemma Games by Using the Presentation Like “Cellular Automatons”

Myopic optimization around scarce resources makes the least use of available information. Such optimization was a winning strategy in the stage when big data was not common but is no longer effective. In reality, winning game differs from the maximizing payoffs. In this article, we focus on an ontological meaning of the game and the time development of the dilemma game. In particular, we are interested in the time development of the dilemma game. After examining the structure of the iterated game, we then introduce the Wolfram simulator by Chandler (Iterated games. http://demonstrations.wolfram.com/IteratedGames/ , 2011) to the original form. This is the presentation like “cellular automatons” (CA-like presentation) of the iterated game. We furthermore expand his original program to discuss TFT, ESS, Avatamsaka game, and the tagging mechanism. The use of CA-like presentation may renovate the traditional implications of the game solution.