THE KERNEL, THE BARGAINING SET AND THE REDUCED GAME

被引：0
|
作者：
CHANG, C
KAN, CY
机构：
[1] Institute of Applied Mathematics, National Tsing Hua University, Hsinchu
来源：
INTERNATIONAL JOURNAL OF GAME THEORY | 1992年 / 21卷 / 01期
关键词：
D O I：
10.1007/BF01240253
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
We present an example showing that for x is-an-element-of K(N, upsilon, B) the section of K(N, upsilon, B) at X\N-B(k) may be a proper subset of K(B(k), upsilon(x), X(k)). Further we prove that under appropriate conditions these two sets coincide. For the bargaining set we prove a similar result.
引用
收藏
页码：75 / 83
页数：9
相关论文
共 50 条
12345