Characterization sets for the nucleolus

被引：30

作者：

Granot, D ^{[1
]}

Granot, F ^{[1
]}

Zhu, WR ^{[1
]}

机构：

[1] Univ British Columbia, Fac Commerce & Business Adm, Vancouver, BC V6T 1Z2, Canada

来源：

INTERNATIONAL JOURNAL OF GAME THEORY | 1998年 / 27卷 / 03期

关键词：

cooperative game; nucleolus; strongly polynomial algorithms; minimum cost spanning tree games;

D O I：

10.1007/s001820050078

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a sequential LP process, and derive a general relationship between the size of a characterization set and the complexity of computing the nucleolus.

引用

页码：359 / 374

页数：16

共 22 条

[1] COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH [J].

BIRD, CG .

NETWORKS, 1976, 6 (04) :335-350

[2]

DERKS J, 1992, 9207 M U LIMB DEP MA

[3] APPLICATIONS OF EFFICIENT MERGEABLE HEAPS FOR OPTIMIZATION PROBLEMS ON TREES [J].

GALIL, Z .

ACTA INFORMATICA, 1980, 13 (01) :53-58

[4] MINIMUM COST SPANNING TREE GAMES [J].

GRANOT, D ;

HUBERMAN, G .

MATHEMATICAL PROGRAMMING, 1981, 21 (01) :1-18

[5]

GRANOT D, 1984, MATH PROGRAM, V29, P323, DOI 10.1007/BF02592000

[6] 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

[7] The kernel/nucleolus of a standard tree game [J].

Granot, D ;

Maschler, M ;

Owen, G ;

Zhu, WR .

INTERNATIONAL JOURNAL OF GAME THEORY, 1996, 25 (02) :219-244

[8]

GRANOT D, 1994, CIRCULAR NETWORK GAM

[9]

HUBERMAN G, 1980, ANAL OPTIMIZATION SY, P416

[10] NUCLEOLUS OF A CHARACTERISTIC FUNCTION GAME [J].

KOHLBERG, E .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) :62-&

← 1 2 3 →