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 …

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 …. Furthermore, full characteriz ations of games for which a k-core cover is nonempty and for which a k-core cover coincides with the …

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 …. Furthermore, full characteriz ations of games for which a k-core cover is nonempty and for which a k-core cover coincides with the …

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

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

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

In this paper we establish a relationship between the core cover of a compromise admissiblegame and the core of a … particular bankruptcy game: the core cover of a compromiseadmissible game is, indeed, a translation of the set of coalitional … stable allocations capturedby an associated bankruptcy game. Moreover, we analyze the combinatorial complexity ofthe core …

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 …