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...

The paper adapts a non cooperative game presented by Dagan, Serrano and Volij (1997) for bankruptcy problems to the context of TU veto balanced games. We investigate the relationship between the Nash outcomes of a noncooperative game and solution concepts of cooperative games such as the...

This paper studies an allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or reject, and con...

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 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.

This paper provides a noncooperative understanding of the nucleolus and the egalitarian allocation for airport cost problems. We find that every Nash equilibrium of the noncooperative game has the nucleolus as outcome while the egalitarian allocation is just one of the Nash outcomes.

We characterize a monotonic core concept defined on the class of veto balanced games. We also discuss what restricted versions of monotonicity are possible when selecting core allocations. We introduce a family of monotonic core concepts for veto balanced games and we show that, in general, the...

The paper presents a framework where the most important single-valued solutions in the literature of TU games are jointly analyzed. The paper also suggests that similar frameworks may be useful for other coalitional models.

We introduce two new monotonicity properties for core concepts: single-valued solution concepts that always select a core allocation whenever the game is balanced (has a nonempty core). We present one result of impossibility for one of the properties and we pose several open questions for the...