FINITE APPROXIMATIONS TO A ZERO-SUM GAME WITH INCOMPLETE INFORMATION

被引：2
|
作者：
MAMER, JW [1 ]
SCHILLING, KE [1 ]
机构：
[1] UNIV MICHIGAN,DEPT MATH,FLINT,MI 48503
来源：
INTERNATIONAL JOURNAL OF GAME THEORY | 1990年 / 19卷 / 01期
关键词：
D O I：
10.1007/BF01753710
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In this paper, we investigate a scheme for approximating a two-person zero-sum game G of incomplete information by means of a natural system Gmn of its finite subgames. The main question is: For large m and n, is an optimal strategy for Gmn necessarily an ε-optimal strategy for G? © 1990 Physica-Verlag.
引用
收藏
页码：101 / 106
页数：6
相关论文
共 50 条
12345