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 …

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 …

An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core … if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the … union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on …

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal … game is called compromise stable if the core is equal to the core cover, i.e. the core is the convex hull of the larginal … vectors. This paper analyzes the structure of orderings corresponding to larginal vectors of the core cover and conditions …

generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a … bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core … for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core …

generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a … bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core … for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core …

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 …

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 …