COMMUNICATION AND ITS COST IN GRAPH-RESTRICTED GAMES

被引:6
作者
ROSENTHAL, EC
机构
关键词
D O I
10.1007/BF00133166
中图分类号
F [经济];
学科分类号
02 ;
摘要
引用
收藏
页码:275 / 286
页数:12
相关论文
共 21 条
[1]   COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH [J].
BIRD, CG .
NETWORKS, 1976, 6 (04) :335-350
[2]  
Claus A., 1973, NETWORKS, V3, P289, DOI DOI 10.1002/NET.3230030402
[3]   TOTALLY BALANCED GAMES ARISING FROM CONTROLLED PROGRAMMING-PROBLEMS [J].
DUBEY, P ;
SHAPLEY, LS .
MATHEMATICAL PROGRAMMING, 1984, 29 (03) :245-267
[4]   THE RELATIONSHIP BETWEEN CONVEX GAMES AND MINIMUM COST SPANNING TREE GAMES - A CASE FOR PERMUTATIONALLY CONVEX GAMES [J].
GRANOT, D ;
HUBERMAN, G .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (03) :288-292
[5]  
GRANOT D, 1986, 1235 U BRIT COL FAC
[6]  
GRANT DL, 1981, NAT RESOUR J, V21, P1
[7]   A GAME THEORETIC APPROACH TO MEASURING DEGREE OF CENTRALITY IN SOCIAL NETWORKS [J].
GROFMAN, B ;
OWEN, G .
SOCIAL NETWORKS, 1982, 4 (03) :213-224
[8]   GENERALIZED NETWORK PROBLEMS YIELDING TOTALLY BALANCED GAMES [J].
KALAI, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1982, 30 (05) :998-1008
[9]   TOTALLY BALANCED GAMES AND GAMES OF FLOW [J].
KALAI, E ;
ZEMEL, E .
MATHEMATICS OF OPERATIONS RESEARCH, 1982, 7 (03) :476-478
[10]  
Megiddo N., 1978, Mathematics of Operations Research, V3, P189, DOI 10.1287/moor.3.3.189