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

The Kernel/Nucleolus of a Standard Tree Game

Author

Listed:
  • Granot, D
  • Maschler, M
  • Owen, G
  • Zhu, W.R.

Abstract

In this paper we characterize the nucleolus (which coincides with the kernel) of a tree enterprise. We also provide a new algorithm to compute it, which sheds light on its structure. We show that in particular cases, including a chain enterprise one can compute the nucleolus in O(n) operations, where n is the number of vertices in the tree. Coauthors are M. Maschler, G. Owen, and W. R. Zhu.

Suggested Citation

  • Granot, D & Maschler, M & Owen, G & Zhu, W.R., 1996. "The Kernel/Nucleolus of a Standard Tree Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 25(2), pages 219-244.
    • Handle: RePEc:spr:jogath:v:25:y:1996:i:2:p:219-44
    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. Hougaard, Jens Leth & Tvede, Mich & Østerdal, Lars Peter, 2013. "Cost Sharing in Chains and Other Fixed Trees," Discussion Papers on Economics 12/2013, University of Southern Denmark, Department of Economics.
    2. Habis, Helga & Herings, P. Jean-Jacques, 2011. "Transferable utility games with uncertainty," Journal of Economic Theory, Elsevier, vol. 146(5), pages 2126-2139, September.
    3. M. Meertens & J. Potters, 2006. "The nucleolus of trees with revenues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 363-382, October.
    4. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    5. Sanjith Gopalakrishnan & Daniel Granot & Frieda Granot, 2021. "Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains," Management Science, INFORMS, vol. 67(12), pages 7637-7668, December.
    6. Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
    7. Miquel, S. & van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2003. "Fixed Tree Games with Repeated Players," Other publications TiSEM 55d10eab-2d36-406b-8e15-4, Tilburg University, School of Economics and Management.
    8. Helga Habis & P. Herings, 2013. "Stochastic bankruptcy games," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 973-988, November.
    9. Habis, Helga, 2012. "Sztochasztikus csődjátékok - avagy hogyan osszunk szét egy bizonytalan méretű tortát? [Stochastic bankruptcy games. How can a cake of uncertain dimensions be divided?]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(12), pages 1299-1310.
    10. Balázs Sziklai & Tamás Fleiner & Tamás Solymosi, 2014. "On the Core of Directed Acyclic Graph Games," CERS-IE WORKING PAPERS 1418, Institute of Economics, Centre for Economic and Regional Studies.
    11. Julio R. Fernández & Inés Gallego & Andrés Jiménez-Losada & Manuel Ordóñez, 2022. "Cost-allocation problems for fuzzy agents in a fixed-tree network," Fuzzy Optimization and Decision Making, Springer, vol. 21(4), pages 531-551, December.
    12. 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.
    13. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    14. Jeroen Kuipers & Dries Vermeulen & Mark Voorneveld, 2010. "A generalization of the Shapley–Ichiishi result," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 585-602, October.
    15. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB School of Economics Working Papers 2015/333, University of Barcelona School of Economics.
    16. Csóka, Péter & Jean-Jacques Herings, P. & Kóczy, László Á. & Pintér, Miklós, 2011. "Convex and exact games with non-transferable utility," European Journal of Operational Research, Elsevier, vol. 209(1), pages 57-62, February.
    17. Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
    18. Miquel, S. & van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2003. "Fixed Tree Games with Repeated Players," Discussion Paper 2003-87, Tilburg University, Center for Economic Research.
    19. Reijnierse, Hans & Potters, Jos, 1998. "The -Nucleolus of TU-Games," Games and Economic Behavior, Elsevier, vol. 24(1-2), pages 77-96, July.
    20. Jens Leth Hougaard & Mich Tvede, 2011. "Incremental Cost Sharing in Chains and Fixed Trees," MSAP Working Paper Series 02_2011, University of Copenhagen, Department of Food and Resource Economics.
    21. Márkus, Judit & Pintér, Miklós & Radványi, Anna, 2011. "The Shapley value for airport and irrigation games," MPRA Paper 30031, University Library of Munich, Germany.

    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:25:y:1996:i:2:p:219-44. 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.