Splitting graphs when calculating Myerson value for pure overhead games.

DOI10.1007/S001860400346zbMATH Open1090.91012OpenAlexW1990582245WikidataQ57618744 ScholiaQ57618744MaRDI QIDQ703208FDOQ703208

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

Publication date: 11 January 2005

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860400346

Recommendations

• Values of games with probabilistic graphs
• A decomposability property to the weighted Myerson value and the weighted position value
• The efficient proportional Myerson values for hypergraph games
• The Myerson value on local structures of coalitions
• Marginality and Myerson values

zbMATH Keywords

graphsMyerson valuecommunication situationoverhead games

Mathematics Subject Classification ID

Cooperative games (91A12) Signaling and communication in game theory (91A28) Games involving graphs (91A43)

Cited In (4)

• The within groups and the between groups Myerson values
• A new value for communication situations
• Attachment centrality: measure for connectivity in networks
• A unified approach to the myerson value and the position value

This page was built for publication: Splitting graphs when calculating Myerson value for pure overhead games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703208)