본문 바로가기
KERD
논문KCI 등재

Balancedness and Concavity of Fractional Domination Games

2

조회

0

다운로드

2

인용

0

참고문헌

주제분류수학

초록

Abstract

In this paper, we introduce a fractional dominationgame arising from fractional domination problems on graphs andfocus on its balancedness and concavity. We rst characterize thecore of the fractional domination game and show that its core isalways non-empty taking use of dual theory of linear programming.Furthermore we study concavity of this game.

참고문헌 (9)

  1. "\it Some applications of the methods of linearprogramming to the theory of cooperative games}", pp.119~ (1963)
  2. "Cooperative Game Theory and Applications-Cooperative Games Arising from Combinatorial Optimization Problems" (1997), Kluwer AcademicPublishers
  3. "Algorithmic aspects of the core of combinatorial optimization games", (3), pp.751~766 (1999)
  4. "Partition games and the core of hierarchically convex cost games", (1269) (1995), Universiteit Twente
  5. T. W. Haynes, "Fundamentals of Domination in Graphs" (1998), Marcel Dekker, INC.
  6. _, "Domination in Graphs-Advanced Topics" (1998), Marces Dekker, INC.
  7. Ow} G. Owen, "\it On the core of linear production games}", pp.358~ (1975)
  8. Sha1971} L. S. Shapley, "\it Core of convex games}", pp.11~ (1971)
  9. Sha} \bysame, "\it On balanced sets and cores}", pp.453~ (1967)

관련 논문AI추천

이 간행물의 다른 논문 (19건)