East Asian mathematical journal

The Youngnam Mathematical Society (영남수학회)
권호 표지
DOI QR코드

DOI QR Code

THE CORES OF PAIRED-DOMINATION GAMES

  • KIM, HYE KYUNG (DEPARTMENT OF MATHEMATICS EDUCATION, CATHOLIC UNIVERSITY OF DAEGU)
  • Received : 2015.09.03
  • Accepted : 2015.09.16
  • Published : 2015.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is natural to ask if for any other variant of dominating set game, the balancedness of a rigid game and the balancedness of a relaxed game are equivalent. In this paper, we show that the answer for the question is negative by considering the rigid and relaxed paired-domination games, which is considered as a variant of dominating set games. We characterize the cores of both games and show that the rigid game being balanced is not equivalent to the relaxed game being balanced. In addition, we study the cores of paired-dominations games on paths and cycles.

Keywords

References

  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. https://doi.org/10.1287/moor.1060.0187
  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. https://doi.org/10.1287/moor.24.3.751
  4. T. W. Haynes and P. J. Slater: Paired-domination in graphs, Networks 32 (1998) 199-206. https://doi.org/10.1002/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F
  5. H. Kim and Q. Fang: Balancedness of integer domination set games, Journal of Korean Mathematics Society 43 (2006) 297-309. https://doi.org/10.4134/JKMS.2006.43.2.297
  6. H. Kim and Q. Fang: Balancedness and concavity of fractional domination games, Bulletin of the Korean Mathematical Society 43 (2006) 265-275. https://doi.org/10.4134/BKMS.2006.43.2.265
  7. Y. Liu and Q. Fang: Balancedness of edge covering games, Applied Mathematics Letters 20 (2007) 1064-1069. https://doi.org/10.1016/j.aml.2006.09.011
  8. Y. Okamoto: Fair cost allocations under conflicts -a game-theoretic point of view-, Discrete Optimization 5 (2008) 1-18. https://doi.org/10.1016/j.disopt.2007.10.002
  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. https://doi.org/10.1016/j.orl.2004.02.004