Stochastic Dynamic Games with Various Types of Information

被引:6
作者
Golubtsov, P. V. [1 ]
Lyubetsky, V. A. [2 ]
机构
[1] Moscow MV Lomonosov State Univ, Moscow 117234, Russia
[2] RAS, Inst Informat Transmiss Problems, Moscow, Russia
关键词
Computer Simulation; Nash Equilibrium; Dynamic Programming; Information Structure; Control Technique;
D O I
10.1023/A:1026114615609
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Dynamic discrete-time games are generalized to a stochastic environment, in order to examine the influence of various types of information structures on the course of a game. It is shown that the information structure of a game, i.e., type and amount of information available to players and, in particular, asymmetry of information, may lead to unexpected and sometimes counter-intuitive effects on the game result, i.e., the players' payoffs. The paper also develops algorithms for obtaining the Nash equilibrium strategies in such games. These involve reducing optimal reaction policies to the corresponding dynamic programming algorithms and generalizing the classical optimal control technique. Results of computer simulations for a variant of fishery harvesting game are presented.
引用
收藏
页码:266 / 293
页数:28
相关论文
共 6 条
[1]  
Clark C., 1980, Dynamic Optimization and Mathematical Economics, P117, DOI DOI 10.1007/978-1-4684-3572-6_7
[2]  
Cripe G., 2001, SPLIT STREAM HARVE 2, P43
[3]  
Geanakopolos J., 1984, HDB GAME THEORY EC A, V2
[4]  
Hernandez-Lerma O., 2012, DISCRETE TIME MARKOV, V30
[5]   THE GREAT FISH WAR - AN EXAMPLE USING A DYNAMIC COURNOT-NASH SOLUTION [J].
LEVHARI, D ;
MIRMAN, LJ .
BELL JOURNAL OF ECONOMICS, 1980, 11 (01) :322-334
[6]  
McKelvey R., 2001, SPLIT STREAM HARVE 1, P1