z-logo
open-access-imgOpen Access
BALANCEDNESS OF INTEGER DOMINATION GAMES
Author(s) -
Hye-Kyung Kim,
Qizhi Fang
Publication year - 2006
Publication title -
journal of the korean mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.403
H-Index - 31
eISSN - 2234-3008
pISSN - 0304-9914
DOI - 10.4134/jkms.2006.43.2.297
Subject(s) - mathematics , integer programming , duality (order theory) , integer (computer science) , monotonic function , focus (optics) , combinatorics , mathematical economics , discrete mathematics , mathematical optimization , computer science , mathematical analysis , physics , optics , programming language
In this paper, we consider cooperative games arising from integer domination problem on graphs. We introduce two games, game and its monotonic relaxed game, and focus on their cores. We first give characterizations of the cores and the relationship between them. Furthermore, a common necessary and sufficient condition for the balancedness of both games is obtained by making use of the technique of linear programming and its duality.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom