Learning in multilevel games with incomplete information - Part I

被引:17
|
作者
Billard, E [1 ]
Lakshmivarahan, S
机构
[1] Calif State Univ Hayward, Dept Math & Comp Sci, Hayward, CA 94542 USA
[2] Univ Oklahoma, Sch Comp Sci, Norman, OK 73019 USA
关键词
chaos; cooperative systems; distributed decision making; Lyapunov methods; Markov process; stochastic automata; stochastic games;
D O I
10.1109/3477.764864
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A model is presented of learning automata playing stochastic games at two levels. The high level represents the choice of the game environment and corresponds to a group decision. The low level represents the choice of action within the selected game environment. Both of these decision processes are affected by delays in the information state due to inherent latencies or to the delayed broadcast of state changes. Analysis of the intrinsic properties of this Markov process is presented along with simulated iterative behavior and expected iterative behavior. The results show that simulation agrees with expected behavior for small step lengths in the iterative map. A Feigenbaum diagram and numerical computation of the Lyapunov exponents show that, for very small penalty parameters, the system exhibits chaotic behavior.
引用
收藏
页码:329 / 339
页数:11
相关论文
共 50 条