On connected dominating set games

  • Kim, Hye-Kyung (Department of Mathematics Education, Catholic University of Daegu)
  • Received : 2011.09.21
  • Accepted : 2011.11.26
  • Published : 2011.12.01

Abstract

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

Keywords

References

  1. Bilbao, J. (2000). Cooperative games on combinatorial structures, Kluwer Academic Publishers, Boston.
  2. Deng, X., Ibaraki, T. and Nagamochi, H. (1999). Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research, 24, 751-766. https://doi.org/10.1287/moor.24.3.751
  3. Haynes, T. W., Hedetniemi, S. T. and Slater, P. J. (1998), Algorithmic aspects of the core of combinatorial optimization games, Marcel Dekker Inc., New York.
  4. Kim, H. K. and Fang, Q. (2006). Balanceness of integer domination set games. Journal of the Korean Mathematical Society, 43, 297-309. https://doi.org/10.4134/JKMS.2006.43.2.297
  5. Kim, H. K. and Park, J. (2009). Balanceness of generalized fractional domination games. Journal of the Korean Data & Information Science Society, 20, 49-55.
  6. Liu, Y. and Fang, Q. (2007). Balanceness of edge covering games. Applied Mathematics Letters, 20, 1064-1069. https://doi.org/10.1016/j.aml.2006.09.011
  7. Na, M. W. and Kwon, Y. M. (2009). Optimization procedure for parameter design using neural network. Journal of the Korean Data & Information Science Society, 20, 829-836.
  8. Bae, I. H. (2010). Design and evaluation of an alert message dissemination algorithm using fuzzy logic for VANETs. Journal of the Korean Data & Information Science Society, 21, 783-794.
  9. Park, B., Kim, S. R. and Kim, H. K. (2011). On the cores of games arising from integer edge covering functions of graphs. preprint.
  10. Velzen, B. V. (2004). Dominating set games. Operations Research Letters, 32, 565-573. https://doi.org/10.1016/j.orl.2004.02.004