Abstract.
In this paper we introduce the ℬ-prenucleolus for a transferable utility game (N,v), where ℬ⊆2N. The ℬ-prenucleolus is a straightforward generalization of the ordinary prenucleolus, where only the coalitions in ℬ determine the outcome. We impose a combinatorial structure on the collection ℬ which enables us to compute the ℬ-prenucleolus in ?(n 3|ℬ|) time. The algorithm can be used for computing the nucleolus of several classes of games, among which is the class of minimum cost spanning tree games.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 4, 1995 / Accepted: May 5, 1997¶Published online June 8, 2000
Rights and permissions
About this article
Cite this article
Kuipers, J., Solymosi, T. & Aarts, H. Computing the nucleolus of some combinatorially-structured games. Math. Program. 88, 541–563 (2000). https://doi.org/10.1007/PL00011385
Issue Date:
DOI: https://doi.org/10.1007/PL00011385