A new algorithm of the state-minimization for the nondeterministic finite automata

1999 ◽  
Vol 6 (2) ◽  
pp. 277-290 ◽  
Author(s):  
B. F. Melnikov
Game Theory ◽  
2017 ◽  
pp. 106-119
Author(s):  
Khaled Suwais

Representing players' strategies in game theory has a direct impact on the players' performance. The state of art shows that automata are one of the primary techniques used for representing players' strategies and behaviors. In this paper, the author will identify different types of automata and assess their utilization in the field of game theory. Is has been found that finite automata, adaptive automata, and cellular automata are widely adopted in game theory. The utilization of finite automata is found to be limited to represent simpler players' behavior. On the other hand, adaptive automata and cellular automata are intensively applied in complex environments, where the number of interacted players is large and therefore, representing complex behaviors are needed.


Sign in / Sign up

Export Citation Format

Share Document