Splitting graphs when calculating Myerson value for pure overhead games

Gómez, Daniel; González–Arangüena, Enrique; Manuel, Conrado; Owen, Guillermo; Pozo, Mónica del; Tejada, Juan

doi:10.1007/s001860400346

Cited by 10 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fortunately, a further simplification is introduced in Gómez et al (2004): as the Shapley value reflects the importance of a node in the routing process, we do not need to consider the whole P(N ), but only the elements that represent valid paths in which the node participates. In addition, ''augmented'' paths shall not be considered.…”

Section: On the Efficient Computation Of The Shapley Valuementioning

confidence: 99%

The Green-Game: Accounting for Device Criticality in Resource Consolidation for Backbone IP Networks

Bianzino¹,

Rougier²,

Chaudet³

et al. 2014

SBE

View full text Add to dashboard Cite

The reduction of energy expenditure of communication networks represents a key issue for the research community. A promising technique acting in this direction is known as ''resource consolidation''. It consists in concentrating the workload of an infrastructure on a reduced set of devices, while switching off the others. Deciding on the set of devices that can be safely switched off requires an accurate evaluation of their criticality in the network. We define here a measure of criticality that takes into account not only the network topology, but also the traffic, and different possible network configurations. We model the scenario as a coalitional game. Shapley value ranking is efficiently used to drive the resource consolidation procedure. Numerical results, on real network scenarios, confirm the robustness and relevance of the proposed index in measuring criticality, yielding a good tradeoff between energy efficiency and network robustness, and outperforming other classical indexes.

show abstract

Section: On the Efficient Computation Of The Shapley Valuementioning

confidence: 99%

The Green-Game: Accounting for Device Criticality in Resource Consolidation for Backbone IP Networks

Bianzino¹,

Rougier²,

Chaudet³

et al. 2014

SBE

View full text Add to dashboard Cite

show abstract

“…In 2001, Algaba-Bilbao-Borm-Lopez characterized the Myerson value for union stable structures [1]. In 2004, Gomez-Gonzalez-Manuel-Owen-Pozo-Tejada calculated the Myerson value of splitting graphs for pure overhead games [3]. In 2012, Kim-Hee introduced various concepts of betweenness and centrality.…”

Section: Introductionmentioning

confidence: 99%

Myerson value of directed hypergraphs

Yamada¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The importance of centrality measures has therefore attracted attention in order to characterize the individual nodes in a network. [9][10][11][12][13][14] Biological networks follow characteristics of real world networks including resistance against random node failures. These characteristics are believed to be due to the scale-free properties of these networks, 1 which suggest that only a small number of nodes are highly connected, whereas a large number of nodes have fewer connections.…”

Section: Introductionmentioning

confidence: 99%

Prediction of conditional gene essentiality through graph theoretical analysis of genome-wide functional linkages

2009

View full text Add to dashboard Cite

The genome of an organism characterizes the complete set of genes that it is capable of encoding. However, not all of the genes are transcribed and translated under any defined condition. The robustness that an organism exhibits to environmental perturbations is partly conferred by the genes that are constitutively expressed under all the conditions, and partly by a subset of genes that are induced under the defined conditions. The conditional importance of genes in conferring robustness can be understood in the context of the functional attributes of these genes and their correlations to the defined environmental conditions. However, a priori prediction of such genes for a given condition is yet not possible. We have attempted such predictions by integrating the available gene expression data with genome-wide functional linkages through the well known centrality-lethality correlations in graph theory. We make use of three distinct concepts of centrality, namely, degree, closeness and betweenness, which yield mutually complementary information. We then demonstrate the efficacy of combined graph theoretical and machine learning approaches in ranking essential nodes from a large network of genome-wide functional linkages, which yields predictions with high accuracy. We therefore perceive such predictions as highly useful in applications such as defining and prioritizing drug targets.

show abstract

Splitting graphs when calculating Myerson value for pure overhead games

Cited by 10 publications

References 9 publications

The Green-Game: Accounting for Device Criticality in Resource Consolidation for Backbone IP Networks

The Green-Game: Accounting for Device Criticality in Resource Consolidation for Backbone IP Networks

Myerson value of directed hypergraphs

Prediction of conditional gene essentiality through graph theoretical analysis of genome-wide functional linkages

Contact Info

Product

Resources

About