Affiliation:
1. Universiti Sains Malaysia, Malaysia
2. Arab Open University, Saudi Arabia
Abstract
In game theory, presenting players with strategies directly affects the performance of the players. Utilizing the power of automata is one way for presenting players with strategies. In this chapter, the authors studied different types of automata and their applications in game theory. They found that finite automata, adaptive automata, and cellular automata are widely adopted in game theory. The applications of finite automata are found to be limited to present simple strategies. In contrast, adaptive automata and cellular automata are intensively applied in complex environment, where the number of interacted players (human, computer applications, etc.) is high, and therefore, complex strategies are needed.
Reference48 articles.
1. Almanasra, S. (2007). Learning opponent behavior in game theory using genetic algorithms. Jordan: Al-Balqa' Applied University.
2. Almanasra, S., & Rafie, M. (2010). Comprehensive survey on automata-based game theory. In Proceedings of the 1st International Symposium on Computing in Science & Engineering (pp. 643-647). IEEE.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献