The lexicographic kernel of a game lexicographically maximizes the surplusses s ij (rather than the excesses as would the nucleolus) and is contained in both the least core and the kernel. We show that an element in the lexicographic kernel can be computed efficiently, provided we can...

The lexicographic kernel of a game lexicographically maximizes the surplusses s <Subscript> ij </Subscript> (rather than the excesses as would the nucleolus) and is contained in both the least core and the kernel. We show that an element in the lexicographic kernel can be computed efficiently, provided we can...</subscript>

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.

We consider classes of cooperative games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains...