We consider the problem of fair cost allocation for traveling salesman games for which the triangle inequality holds. We give examples showing that the core of such games may be empty, even for the case of Euclidean distances. On the positive side, we develop an LP-based allocation rule guaranteeing that ... more >>>

The {\it nucleon} is introduced as a new allocation concept for non-negative cooperative n-person transferable utility games. The nucleon may be viewed as the multiplicative analogue of Schmeidler's nucleolus. It is shown that the nucleon of (not necessarily bipartite) matching games can be computed in polynomial time. more >>>