Gamma-Component Additive Games
According to Maschler, Peleg and Shapley (1972) the bargaining set of a convex game coincides with its core and the kernel consists of the nucleolus only. In this paper we prove the same properties for [Gamma]-component additive games (= graph restricted games in the sense of Owen (1986)) if [Gamma] is a tree. Furthermore, we give a description of the nucleolus of this type of games which makes it easier accessible for computation.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 24 (1995)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:24:y:1995:i:1:p:49-56. 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: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.