We prove that the SD-prenucleolus satisfies monotonicity in the class of convex games. The SD-prenucleolus is thus the only known continuous core concept that satisfies monotonicity for convex games. We also prove that for convex games the SD-prenucleolus and the SD-prekernel coincide.

In 1972, Maschler, Peleg and Shapley proved that in the class of convex the nucleolus and the kernel coincide. The only aim of this note is to provide a shorter, alternative proof of this result.

We introduce and characterize a new solution concept for TU games. The new soluction is called SD-prenucleolus and is a lexicographic value although is not a weighted prenucleolus. The SD-prenucleolus satisfies several desirable poperties and is the only known solution that satisfies core...