In this paper we introduce two related core-type solutions for games with transferable utility (TU-games) the [Formula: see text]-core and the [Formula: see text]-core. The elements of the solutions are pairs [Formula: see text] where x, as usual, is a vector representing a distribution of utility and [Formula: see text] is a balanced family of coalitions, in the case of the [Formula: see text]-core, and a minimal balanced one, in the case of the [Formula: see text]-core, describing a plausible organization of the players to achieve the vector x. Both solutions extend the notion of classical core but, unlike it, they are always nonempty for any TU-game. For the [Formula: see text]-core, which also exhibits a certain kind of "minimality" property, we provide a nice axiomatic characterization in terms of the four axioms nonemptiness (NE), individual rationality (IR), superadditivity (SUPA) and a weak reduced game property (WRGP) (with appropriate modifications to adapt them to the new framework) used to characterize the classical core. However, an additional axiom, the axiom of equal opportunity is required. It roughly states that if [Formula: see text] belongs to the [Formula: see text]-core then, any other admissible element of the form [Formula: see text] should belong to the solution too.