On the cores of games arising from integer edge covering functions of graphs |
| |
Authors: | Boram Park Suh-Ryung Kim Hye Kyung Kim |
| |
Affiliation: | 1. DIMACS, Rutgers University, Piscataway, NJ, 08854, USA 2. Department of Mathematics Education, Seoul National University, Seoul, 151-742, Korea 3. Department of Mathematics, Catholic University of Daegu, Daegu, 712-702, Korea
|
| |
Abstract: | In this paper, we study cooperative games arising from integer edge covering problems on graphs. We introduce two games, a rigid k-edge covering game and its relaxed game, as generalizations of a rigid edge covering game and its relaxed game studied by Liu and Fang (2007). Then we give a characterization of the cores of both games, find relationships between them, and give necessary and sufficient conditions for the balancedness of a rigid k-edge covering game and its relaxed game. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|