Computing the nucleolus of some combinatorially-structured games
In this paper we introduce the B-prenucleolus for a transferable utility game (N, v), where B subset of or equal to 2(N). The B-prenucleolus is a straightforward generalization of the ordinary prenucleolus, where only the coalitions in B determine the outcome. We impose a combinatorial structure on the collection B which enables us to compute the B-prenucleolus in O(n(3)/B/) time. The algorithm can be used for computing the nucleolus of several classes of games, among which is the case of minimum cost spanning tree games.
games tu (pre)nucleolus computational complexity