On the Nucleous of Neighbour Games.

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms or order p4 for calculating the nucleolus, where p is the number of players. In this paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games.