Bargaining with graph-restricted communication

We study n-person bargaining problems where not all players can freely communicate, but there are some restrictions to the communication embodied in an undirected connected graph, in such a way that two players can directly communicate if and only if there is a link of the graph joining them. These restrictions can produce asymmetries in the negotiation process which might affect its final result. In this setup we propose some solutions and study some of their properties.