We study cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class of games. Given the graph structure...

We propose a model on strategic formation of communication networks with (i) link specificity: the more direct links somebody maintains, the less she can specify her attention per link, the lower her links’ value, while this negative externality was previously ignored in the communication...

We propose a model on strategic formation of communication networks with (i) link specificity: the more direct links somebody maintains, the less she can specify her attention per link, the lower her links’ value, while this negative externality was previously ignored in the communication...

In this paper we study the structure of the bilateral communication links within Online Consumer Communication Networks (OCCNs), such as virtual communities. Compared to the offline world, consumers in online networks are highly flexible to choose their communication partners and little is known...

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...

We analyze the structure of bilateral communication links among consumers in virtual communities by a game-theoretic model of network formation. First, link specificity is incorporated, meaning that the more direct links somebody has to maintain with others, the less she is able to specify her...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...