Cost monotonicity, consistency and minimum cost spanning tree games

被引:66
作者
Dutta, B [1 ]
Kar, A
机构
[1] Univ Warwick, Coventry CV4 7AL, W Midlands, England
[2] Indian Stat Inst, New Delhi 110016, India
关键词
spanning tree; cost allocation; core selection; cost monotonicity; consistency;
D O I
10.1016/j.geb.2003.09.008
中图分类号
F [经济];
学科分类号
02 ;
摘要
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satisfies cost monotonicity. We also give characterisation theorems for the new rule as well as the much-studied Bird allocation. We show that the principal difference between these two rules is in terms of their consistency properties. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:223 / 248
页数:26
相关论文
共 16 条
[1]   COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH [J].
BIRD, CG .
NETWORKS, 1976, 6 (04) :335-350
[2]   KERNEL OF A COOPERATIVE GAME [J].
DAVIS, M ;
MASCHLER, M .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1965, 12 (3-4) :223-&
[3]  
FELTKAMP V, 1995, THESIS NWO NETHERLAN
[4]  
GRAHAM RL, 1985, ANN HIST COMPUT, V7, P43
[5]   Spanning network games [J].
Granot, D ;
Maschler, M .
INTERNATIONAL JOURNAL OF GAME THEORY, 1998, 27 (04) :467-500
[6]   MINIMUM COST SPANNING TREE GAMES [J].
GRANOT, D ;
HUBERMAN, G .
MATHEMATICAL PROGRAMMING, 1981, 21 (01) :1-18
[7]  
GRANOT D, 1984, MATH PROGRAM, V29, P323, DOI 10.1007/BF02592000
[8]   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
[9]   POTENTIAL, VALUE, AND CONSISTENCY [J].
HART, S ;
MASCOLELL, A .
ECONOMETRICA, 1989, 57 (03) :589-614
[10]  
KAR A, 2002, GAME ECON BEHAV, P38