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

Note Computing the nucleolus of min-cost spanning tree games is NP-hard

Author

Listed:
  • Jeroen Kuipers

    (Instituto de Economia Publica, Universidad del Pais Vasco, Avda. Lehen-Dakari Aguirre 83, E-48015 Bilbao, Spain)

  • Ulrich Faigle

    (Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands)

  • Walter Kern

    (Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands)

Abstract

We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems.

Suggested Citation

  • Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.
    • Handle: RePEc:spr:jogath:v:27:y:1998:i:3:p:443-450
    Note: Received October 1997/Final version May 1998
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00182/papers/8027003/80270443.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    2. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    3. repec:has:discpr:1321 is not listed on IDEAS
    4. 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.
    5. 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.
    6. Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
    7. 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.
    8. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    9. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    10. 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.
    11. Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
    12. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    13. Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.

    More about this item

    Keywords

    Nucleolus ·;

    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:27:y:1998:i:3:p:443-450. 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.