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

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.

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

This paper provides a new model of network formation that bridges the gap between the two benchmark models by Bala and Goyal, the one-way flow model, and the two-way flow model, and includes both as particular extreme cases. As in both benchmark models, in what we call an "asymmetric flow"...

The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are...