Abstract.
We study cooperation structures with the following property: given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. TU-games restricted by union stable systems generalize graph-restricted games and games with permission structures. A study about the differences between the position value in union stable systems and hypergraph communication situations is given. Moreover, some computational aspects related to position value in union stable systems are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been partially supported by the Spanish Ministery of Science and Technology, under grant SEC2003-00573.
Rights and permissions
About this article
Cite this article
Algaba, E., Bilbao, J. & López, J. The position value in communication structures. Math Meth Oper Res 59, 465–477 (2004). https://doi.org/10.1007/s001860400343
Issue Date:
DOI: https://doi.org/10.1007/s001860400343
Key words.
- Position value
- Communication situations
- Permission structures
- Hypergraph communication situations
- Union stable systems