Fair link contributions for values of network cooperative games

Abstract

A network game $(N,v,L)$ consists of a cooperative game $(N,v)$ and a network $(N,L)$, in which the formation of coalitions of players is restricted by $L$ and links in $L$ signify communication between players. Two well-known allocation rules for network games are the Myerson value and the position value, the latter of which is defined on the network game $(N,v,L)$ where the underlying game $(N,v)$ is zero-normalized. In this paper we propose new axiomatic characterizations of the Myerson value. Furthermore, we define a new position value without restriction of zero-normalization on game $(N,v)$ and establish a characterization of the position value.