shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper … introduces the notion of the k-core cover as an extension of the core cover. The k-core cover of a TU-game consists of all … minimal rights game. It is shown that the core of a TU-game with player set N coincides with the L|N |/2-̦core cover …

merge convex and ordinal convex. Generalizing the notions of core cover and compromise stability for transferable utility …

of coalitions are explicitly taken into account. We formulate conditions under which it leads to a core element and …

cooperative games with transferable utility. This notion is used to axiomatically characterize the core on the domain of convex … value, (b) all homothetic images of the core with the Shapley value as center of homothety and with positive ratios of …

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence … constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under … generalized Davis-Maschler reduced games, and the possibility of nondiscrimination. The bounded positive core, i.e., the union of …

It is well-known that the core on several domains of cooperative transferable utility (TU) and nontransferable utility … is shown that, if communication structures are present, the core may still be characterized on balanced TU games, on … totally balanced TU games, on NTU games with a nonempty core, on the domains of all TU or NTU games, and on several other …

shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper … introduces the notion of the k-core cover as an extension of the core cover. The k-core cover of a TU-game consists of all … minimal rights game. It is shown that the core of a TU-game with player set N coincides with the ⌊|N |/2⌋-core cover …

We show that on the domain of convex games, Dutta-Ray's egalitarian solution is characterized by core selection … core. Replacing "poorest" by "poorer" allows to eliminate aggregate monotonicity. Moreover, strengthening core selection …

It is known that for supermodular TU-games, the vertices of the core are the marginal vectors, and this result remains …, obtained by minimizing or maximizing in a given order the coordinates of a core element. We give a simple formula which does …, and show that there exist balanced games whose core has vertices which are not min-max vertices if and only if n > 4 …