Nash Play Strings of Symmetric Games and Their Language Classes

Akihiro Takeuchi · Journal of Cybernetics · 1974

It is an interesting point of view to consider N-person games as models of human behavior and their decision making processes in the society. Bryzgalov et al. [1] have proposed a kind of N-person game in which all players are equivalent, i.e., homogeneous games. In this paper, considering one of the homogeneous games, i.e., symmetric games, and assuming the patterns of Nash play strings as a language, we determine the language classes of them.

Read the paper · More papers on PaperTik