Splitting graphs when calculating Myerson value for pure overhead games.

DOI10.1007/s001860400346zbMath1090.91012OpenAlexW1990582245WikidataQ57618744 ScholiaQ57618744MaRDI QIDQ703208

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

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

zbMATH Keywords

graphsMyerson valuecommunication situationoverhead games

Mathematics Subject Classification ID

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

Related Items (1)

Attachment centrality: measure for connectivity in networks

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