RT Journal Article
T1 Bargaining with graph-restricted communication
A1 Casas Méndez, Balbina
A1 García Jurado, Ignacio
A1 Prada Sánchez, José Manuel
K1 Game theory
K1 Bargaining games
K1 Graphs
AB In this paper 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 define some solutions and study some of their properties.
PB Université Libre de Bruxelles
SN 0008-9737
YR 1995
FD 1995-01
LK http://hdl.handle.net/10347/33099
UL http://hdl.handle.net/10347/33099
LA eng
NO Cahiers du C.E.R.O., volume 37 (1995), 25-41
NO Universidad de Santiago de Compostela y Xunta de Galicia. Proyectos 60902.25064(5060), XUGA20701B91, XUGA20702B93.
DS Minerva
RD 23 abr 2026