Back to Search
Start Over
An Approach for Reducing the Graphical Model and Genetic Algorithm for Computing Approximate Nash Equilibrium in Static Games.
- Source :
- Journal of Intelligent & Robotic Systems; Nov2010, Vol. 60 Issue 2, p241-261, 21p, 3 Charts, 4 Graphs
- Publication Year :
- 2010
-
Abstract
- In this paper, an approach for reducing the graphical model and a genetic algorithm for computing the approximate Nash equilibrium in a static multi-agent game is studied. In order to describe the relationship between strategies of various agents, the concepts of the influence degree and the strategy dependency are presented. Based on these concepts, an approach for reducing a graphical model is given. For discretized mixed strategies, the relationship between the discrete degree and the approximate degree is developed. Based on the regret degree, a genetic algorithm for computing the approximate Nash equilibrium is given. Experimental results indicate the genetic algorithm has high efficiency and few equilibrium errors. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09210296
- Volume :
- 60
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Journal of Intelligent & Robotic Systems
- Publication Type :
- Academic Journal
- Accession number :
- 53945200
- Full Text :
- https://doi.org/10.1007/s10846-010-9419-6