Splitting graphs when calculating Myerson value for pure overhead games



Downloads per month over past year

González-Arangüena, Enrique and Manuel García, Conrado Miguel and Owen, Guillermo and Pozo, M. del and Tejada Cazorla, Juan Antonio (2004) Splitting graphs when calculating Myerson value for pure overhead games. Mathematical Methods of Operations Research, 59 (3). pp. 479-489. ISSN 1432-2994

[thumbnail of Tejada03.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.springerlink.com/content/ldf74p3lrd2pl2d9/fulltext.pdf


A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given.

Item Type:Article
Uncontrolled Keywords:Communication situations, Graph-Restricted Game, Myerson value, Pure overhead games
Subjects:Sciences > Mathematics > Operations research
ID Code:15910
Deposited On:11 Jul 2012 10:54
Last Modified:21 Jun 2018 10:26

Origin of downloads

Repository Staff Only: item control page