A BASED WORDS AND AUTOMATA MODEL FOR INFINITELY REPEATED GAMES

被引：0
|
作者：
Arfi, M. [1 ]
Lemine, B. Ould M. [2 ]
Selmi, C. [2 ]
机构：
[1] Univ Havre, BP 540, F-76058 Le Havre, France
[2] Univ Rouen, F-76801 St Etienne Rouvray, France
来源：
EUROPEAN SIMULATION AND MODELLING CONFERENCE 2008 | 2008年
关键词：
Modelling; infinite words; formal languages; game theory; strategy; Nash equilibrium;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we deal with modelling infinitely repeated games by using infinite words. These games are supposed noncooperative and with a perfect knowledge of the previous moves. In this context, we give a general definition of a Nash equilibrium, that we illustrate with a famous example.
引用
收藏
页码：307 / +
页数：2
相关论文
共 50 条
12345