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 …

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 these games have a nonempty core and a complete description of the core is provided …

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

different voting systems within the same parliamentary body. This paper analyzes the core and the Shapley value of three …-valued simple games. Using the concept of vital players, the vital core is constructed and we show that the vital core is a subset … of the core. The Shapley value is characterized on the class of all three-valued simple games. The model is applied to …

coalitions we show that every Step out - Step in sequencing game<br/>has a non-empty core. This upper bound is a sufficient … condition for a sequencing<br/>game to have a non-empty core. Moreover, this paper provides a polynomial time<br/>algorithm to …

of all players, equal gain splitting rules are defined.It is shown that these rules lead to core elements of the …