The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties

This paper introduces yet another algorithm to compute the nucleolus of a standard tree game. One advantage of this algorithm is that it provides a very intuitive interpretation of the nucleolus, under which the players participate in a joint enterprize in which each group sends a member to help the community. Another advantage is that it demonstrates monotonicity properties of the nucleolus within this class of games. As a consequence the nucleolus of a tree game can be extended to a population monotonic allocation scheme.