Experiments on symmetric two person games, played by players connected in network.

被引：0

作者：

Sukhotina, MA ^{[1
]}

Petrosjan, LA ^{[1
]}

机构：

[1] St Petersburg State Univ, Fac Appl Math & Control Proc, St Petersburg 198904, Russia

来源：

CONTROL APPLICATIONS OF OPTIMIZATION 2000, VOLS 1 AND 2 | 2000年

关键词：

game theory; matrix; maximum; network; stability; convergence;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Experiments on symmetric two person games played by players connected in network are presented. First the arbitrary planar network is considered with players situated in nodes and repeatedly playing the same 2x2 bimatrix symmetric game. The learning rule was defined as follows. Each player at each stage observes the results of the play played by players directly connected with her. She selects the opponent with maximal result and on the next stage changes her strategy on the strategy of that opponent. In this special case it is proved that the convergence accrue after not more than N stages, where N - is the number of the nodes in the network. Copyright (C) 2000 IFAC.

引用

页码：653 / 658

页数：6