We analyze surplus allocation problems where cooperation between agents is restricted both by a communication graph and by a sequence of embedded partitions of the agent set. For this type of problem, we define and characterize two new values extending the Shapley value and the Banzhaf value...

We study a coordination game of incomplete information in which only a coordinated attack would succeed in toppling a regime. Without communication, efficient coordination is impossible in this environment. We study how communication between citizens can facilitate efficient coordination. We...

Recently, both theoretical and experimental literatures have incorporated the ability of strategic players to communicate verbally prior to choosing their actions. We design an experiment to show how and why presence and type of communication matters. We use a multilateral bargaining setting,...

One of the most robust phenomena in the experimental literature on multilateral bargaining is the failure of proposers to extract equilibrium rents. However, all previous experiments have overlooked the fact that outside the lab committee members are allowed to - and do - engage in sometimes...

In standard coalition games, players try to form a coalition to secure a prize and a coalition agreement specifies how the prize is to be split among its members. However, in practical situations where coalitions are formed, the actual split of the prize often takes place after the coalition...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...

In standard coalition games, players try to form a coalition to secure a prize and a coalition agreement specifies how the prize is to be split among its members. However, in practical situations where coalitions are formed, the actual split of the prize often takes place after the coalition...

We consider a communications network in which users transmit beneficial information to each other at a cost. We pinpoint conditions under which the induced cooperative game is supermodular (convex). Our analysis is in a lattice-theoretic framework, which is at once simple and able to encompass a...

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...