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

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.

MoreLess

Year of publication:	1998-11-02
Authors:	Kuipers, Jeroen ; Faigle, Ulrich ; Kern, Walter
Published in:	International Journal of Game Theory. - Springer. - Vol. 27.1998, 3, p. 443-450
Publisher:	Springer
Subject:	Nucleolus

More details

Extent:	application/pdf
Type of publication:	Article
Notes:	Received October 1997/Final version May 1998
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005598406