which they usually take different positions. Two examples of such structures are communication networks and hierarchies. In … feasible sets in communication networks and compare them with feasible sets arising from hierarchies. …

. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common … models of communication and hierarchy restrictions in cooperative games, compare different network structures with each other … and discuss network structures that combine communication as well as hierarchical features. Throughout the survey, we …

how communication mitigates this free-riding problem in an investment-timing game. In our baseline investment-timing game …. If more investors invest at the same time, they share the costs. In the communication treatment, subjects can freely … communicate before choosing the investment time. We find that in groups of two players, communication increases cooperation and …

In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in … Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the … players enter the coalition. Therefore, we model the communication network by a directed graph and the cooperative game by a …

We study cooperative games with communication structure, represented by an undirected graph. Players in the game are … complete communication structure, then the proposed solution coincides with the Shapley value, and that if the game has a cycle …-free communication structure, it is the solution proposed by Herings, van der Laan and Talman (2008). We introduce the notion of link …

This article analyzes under which conditions a manager can motivate a junior worker by verbal communication, and … explains why communication is often tied up with organizational choices as job enlargement and collaboration. Our model has two …

-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate …