1 |
B. van Velzen, Dominating set game, Oper. Res. Lett. 32 (2004), no. 6, 565-573
DOI
ScienceOn
|
2 |
G. Owen, On the core of linear production games, Mathematical Programming 9 (1975), no. 3, 358-370
DOI
|
3 |
O. N. Bondareva, Some applications of the methods of linear programming to the theory of cooperative games, (Russian) Problemy Kibernet. 10 (1963), 119-139
|
4 |
I. Curiel, Cooperative game theory and applications. Cooperative games arising from combinatorial optimization problems, Kluwer Academic Publishers, Boston, 1997
|
5 |
X. Deng, T. Ibaraki, and H. Nagamochi, Algorithmic aspects of the core of com- binatorial optimization games, Math. Oper. Res. 24 (1999), no. 3, 751-766
DOI
|
6 |
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Domination in graphs. Advanced topics, Marcel Dekker, Inc., New York, 1998
|
7 |
U. Faigle and W. Kern, Partition games and the core of hierarchically convex cost games, (Universiteit Twente, faculteit der toegepaste wiskunde, Memorandum, No. 1269. 1995)
|
8 |
M. R. Garey and D. S. Johnson, Computers and intractability, A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco, 1979
|
9 |
T. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of domination in graphs, Marcel Dekker, Inc., New York, 1998
|
10 |
L. S. Shapley, On balanced sets and cores, Naval Res. Quart. 14 (1967), 453{460
DOI
|
11 |
L. S. Shapley and M. Shubik, The assignment game, I. The core, Internat. J. Game Theory 1 (1972), no. 2, 111{130
|