The kernel/nucleolus of a standard tree game

被引：42
作者：
Granot, D
Maschler, M
Owen, G
Zhu, WR
机构：
[1] HEBREW UNIV JERUSALEM, INST MATH, IL-91904 JERUSALEM, ISRAEL
[2] USN, POSTGRAD SCH, MONTEREY, CA 93940 USA
来源：
INTERNATIONAL JOURNAL OF GAME THEORY | 1996年 / 25卷 / 02期
关键词：
D O I：
10.1007/BF01247104
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
In this paper we characterize the nucleolus (which coincides with the kernel) of a tree enterprise. We also provide a new algorithm to compute it, which sheds light on its structure. We show that in particular cases, including a chain enterprise one can compute the nucleolus in O(n) operations, where n is the number of vertices in the tree.
引用
收藏
页码：219 / 244
页数：26
相关论文
共 16 条
[1]   COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH [J].
BIRD, CG .
NETWORKS, 1976, 6 (04) :335-350
[2]   APPLICATIONS OF EFFICIENT MERGEABLE HEAPS FOR OPTIMIZATION PROBLEMS ON TREES [J].
GALIL, Z .
ACTA INFORMATICA, 1980, 13 (01) :53-58
[3]   MINIMUM COST SPANNING TREE GAMES [J].
GRANOT, D ;
HUBERMAN, G .
MATHEMATICAL PROGRAMMING, 1981, 21 (01) :1-18
[4]  
GRANOT D, 1984, MATH PROGRAM, V29, P323, DOI 10.1007/BF02592000
[5]   COMPUTATIONAL-COMPLEXITY OF A COST ALLOCATION APPROACH TO A FIXED COST SPANNING FOREST PROBLEM [J].
GRANOT, D ;
GRANOT, F .
MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (04) :765-780
[6]  
GRANOT D, 1994, SPANNING NETWORK GAM
[7]  
Littlechild S.C., 1977, Int. J. Game Theory, V5, P91
[8]  
Littlechild S. C., 1974, INT J GAME THEORY, V3, P21
[9]   AIRCRAFT LANDING FEES - GAME THEORY APPROACH [J].
LITTLECHILD, SC ;
THOMPSON, GF .
BELL JOURNAL OF ECONOMICS, 1977, 8 (01) :186-204
[10]  
Maschler M., 1972, International Journal of Game Theory, V1, P73
12