IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v24y1995i1p49-56.html
   My bibliography  Save this article

Gamma-Component Additive Games

Author

Listed:
  • Potters, Jos
  • Reijnierse, Hans

Abstract

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.

Suggested Citation

  • Potters, Jos & Reijnierse, Hans, 1995. "Gamma-Component Additive Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(1), pages 49-56.
    • Handle: RePEc:spr:jogath:v:24:y:1995:i:1:p:49-56
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schouten, Jop & Dietzenbacher, Bas & Borm, Peter, 2019. "The Nucleolus and Inheritance of Properties in Communication Situations," Discussion Paper 2019-008, Tilburg University, Center for Economic Research.
    2. E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2000. "The position value for union stable systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 221-236, November.
    3. Daniel Granot & Jeroen Kuipers & Sunil Chopra, 2002. "Cost Allocation for a Tree Network with Heterogeneous Customers," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 647-661, November.
    4. Algaba, A. & Bilbao, J.M. & Borm, P.E.M., 1999. "The Myerson Value for Union Stable Systems," Other publications TiSEM 022b6f46-8f76-4bb3-acab-3, Tilburg University, School of Economics and Management.
    5. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    6. Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink & Jorge J. Lopez, 2011. "The Myerson Value and Superfluous Supports in Union Stable Systems," Tinbergen Institute Discussion Papers 11-127/1, Tinbergen Institute.
    7. Tamás Solymosi, 2008. "Bargaining sets and the core in partitioning games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 425-440, December.
    8. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
    9. J. Schouten & B. Dietzenbacher & P. Borm, 2022. "The nucleolus and inheritance of properties in communication situations," Annals of Operations Research, Springer, vol. 318(2), pages 1117-1135, November.
    10. E. Algaba & J.M. Bilbao & J.J. López, 2001. "A unified approach to restricted games," Theory and Decision, Springer, vol. 50(4), pages 333-345, June.
    11. van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Other publications TiSEM 14e21ac6-26af-438e-943b-9, Tilburg University, School of Economics and Management.
    12. Imma Curiel, 2010. "Multi-stage sequencing situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 151-162, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.