Cooperation when some players are incompatible

A situation with incompatibilities is defined to be a TU-game together with a graph whose arcs link pairs of incompatible players. In this paper we introduce an efficient and fair allocation rule which selects a payoff for every possible situation with incompatibilities (when the set of players is fixed), and prove that it is uniquely determined. Besides, we demonstrate that it is stable, study its relationship with the so-calledIR-Shapley value and show that it generalizes an earlier theory for simple games. Finally, the communication situations with incompatibilities are studied.We thank University of Santiago de Compostela and Xunta de Galicia for financial support through projects 60902.25064(5060) and XUGA20701B91.