1 |
J. M. Bilbao, Cooperative games on combinatorial structures, Kluwer Academic Publishers, Boston (2000).
|
2 |
T. Bietenhader and Y. Okamoto: Core stability of minimum coloring games, Mathematics of Operations Research 31 (2006) 418-431.
DOI
ScienceOn
|
3 |
X. Deng, T. Ibaraki and H. Nagamochi: Algoritheoremic aspects of the core of combinatorial optimization games, Mathematics of Operations Research 24 (1999) 751-766.
DOI
|
4 |
T. W. Haynes and P. J. Slater: Paired-domination in graphs, Networks 32 (1998) 199-206.
DOI
|
5 |
H. Kim and Q. Fang: Balancedness of integer domination set games, Journal of Korean Mathematics Society 43 (2006) 297-309.
DOI
ScienceOn
|
6 |
H. Kim and Q. Fang: Balancedness and concavity of fractional domination games, Bulletin of the Korean Mathematical Society 43 (2006) 265-275.
DOI
ScienceOn
|
7 |
Y. Liu and Q. Fang: Balancedness of edge covering games, Applied Mathematics Letters 20 (2007) 1064-1069.
DOI
ScienceOn
|
8 |
Y. Okamoto: Fair cost allocations under conflicts -a game-theoretic point of view-, Discrete Optimization 5 (2008) 1-18.
DOI
ScienceOn
|
9 |
B. Park, S.-R. Kim and H. Kim: On the cores of games arising from integer edge covering functions of graphs, preprint.
|
10 |
B. V. Velzen: Dominating set games, Operations Research Letters 32 (2004) 565-573.
DOI
ScienceOn
|