Skip to main content
Log in

The Myerson value for union stable structures

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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. These combinatorial structures have a direct relationship with graph communication situations and conference structures à la Myerson. Characterizations of the Myerson value in this context are provided using the concept of basis for union stable systems. Moreover, TU-games restricted by union stable systems generalizes graph-restricted games and games with permission structures.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Manuscript received: January 2001/Final version received: June 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Algaba, E., Bilbao, J., Borm, P. et al. The Myerson value for union stable structures. Mathematical Methods of OR 54, 359–371 (2001). https://doi.org/10.1007/s001860100159

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860100159

Navigation