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 …

game, is associated with this allocation problem, and an l(n2) algorithm is given which computes a core element of a … routing game if the core is non-empty. The non-emptiness of the core depends on the tour which is traversed by the repairman …. Several procedures are given to construct tours which guarantee the non-emptiness of the core …

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 …

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 …

We adapt the core concept to deal with economies in which trade in assets takes place at period 1, uncertainty about … asset payoffs is released at period 2, and agents trade in commodities afterwards. We define the weak sequential core as the … period 1 that cannot be counterblocked by some subcoalition at period 2. We study the relationship of the resulting core …

In cooperative games, the coalition structure core is, despite its potential emptiness, one of the most popular …

threshold meets the stability requirements of the core and stable sets. In addition, based on our stability study, we argue that …, and show that our method always generates a nonempty refinement of the core. We also provide an axiomatic characterization …

In this paper conditions are given guaranteeing that the Core equals the D-core (the set of unDominated imputations …