uses the fact that the core of an associated compensation matching game with constraints is nonempty. …In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by … matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in …

allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost … consideration to all its members, it is shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only … if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games …

allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost … consideration to all its members, it is shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only … if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games …

In this paper we provide three new characterizations of largeness of the core. The first characterization of largeness … of the core is based on minimal covers of the grand coalition and associated inequalities. The second characterization … shows the relation between the bases that provide core elements of the game and the bases that provide core elements of the …

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 …

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 ? …

rise to lower and upper bounds for the core payoff vectors and, using these bounds, we define the weighted super core as a … polyhedron that contains the core. It turns out that the least square values can be seen as a center of this weighted super core …, giving a third new characterization of the least square values. Finally, these lower and upper bounds for the core inspire us …