Published in:CentER Discussion Paper Series ; No. 2015-057
Extent:
1 Online-Ressource (17 p)
Language:
English
DOI:
10.2139/ssrn.2701736
Identifier:
Origination:
Footnote:
Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments December 10, 2015 erstellt
Description:
Using network control structures this paper introduces network communication games as a generalization of vertex games and edge games corresponding to communication situations and studies their decomposition into unanimity games. We obtain a relation between the dividends of the network communication game and the underlying transferable utility game, which depends on the structure of the undirected graph. This relation extends the computational results for tree communication networks to general undirected graphs and is used to derive new characterizations of the Myerson value and the position value. Moreover, network communication games also allow to consider both the vertices and the edges of the graph as players, leading to a new network value