Computing the nucleolus by solving a prolonged simplex algorithm

被引：17

作者：

Potters, JAM

Reijnierse, JH

Ansing, M

机构：

[1] Department of Mathematics, University of Nijmegen, Toernooiveld

来源：

MATHEMATICS OF OPERATIONS RESEARCH | 1996年 / 21卷 / 03期

关键词：

TU-game; nucleolus; simplex method;

D O I：

10.1287/moor.21.3.757

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];

摘要：

This paper describes a fast algorithm to find the nucleolus of any game with a nonempty imputation set. It is based on the algorithm scheme of Maschler et al. (1992) for the general nucleolus.

引用

页码：757 / 768

页数：12

共 11 条

[1]

Dragan I., 1981, Zeitschrift fur Operations Research, Serie A (Theorie), V25, P119, DOI 10.1007/BF01919297

[2]

NUCLEOLUS AS A SOLUTION OF A MINIMIZATION PROBLEM [J].

KOHLBERG, E .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1972, 23 (01) :34-&

[3]

KUIPERS J, 1994, THESIS MAASTRICHT

[4]

Maschler M., 1979, Mathematics of Operations Research, V4, P303, DOI 10.1287/moor.4.4.303

[5]

MASCHLER M, 1992, INT J GAME THEORY, V21, P83

[6]

Nemhauser G. L., 1988, Integer and Combinatorial Optimization

[7]

Owen G., 1974, International Journal of Game Theory, V3, P101, DOI 10.1007/BF01766395

[8]

ON FINDING THE NUCLEOLUS OF AN N-PERSON COOPERATIVE GAME [J].

SANKARAN, JK .

INTERNATIONAL JOURNAL OF GAME THEORY, 1991, 19 (04) :329-338

[9]

NUCLEOLUS OF A CHARACTERISTIC FUNCTION GAME [J].

SCHMEIDL.D .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (06) :1163-&

[10]

AN ALGORITHM FOR FINDING THE NUCLEOLUS OF ASSIGNMENT GAMES [J].

SOLYMOSI, T ;

RAGHAVAN, TES .

INTERNATIONAL JOURNAL OF GAME THEORY, 1994, 23 (02) :119-143

← 1 2 →