The Myerson value for union stable structures
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. Copyright Springer-Verlag Berlin Heidelberg 2001
Volume (Year): 54 (2001)
Issue (Month): 3 (December)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.ngb-online.nl/
|Order Information:||Web: http://www.springer.com/economics/journal/00186|
When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:54:y:2001:i:3:p:359-371. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.