On the restricted cores and the bounded core of games on distributive lattices

Abstract : We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence 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. The bounded core proves to be the union of all bounded faces (restricted cores). The paper aims at investigating in depth the relation between the bounded core and restricted cores, as well as the properties and structures of the restricted cores and normal collections. In particular, it is found that a game is convex if and only if all restricted cores corresponding to the minimal nested normal collections are nonempty. Moreover, in this case the union of these restricted cores already covers the bounded core.
Document type :
Other publications
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

Contributor : Lucie Label <>
Submitted on : Monday, November 5, 2012 - 12:17:47 PM
Last modification on : Friday, March 15, 2019 - 5:08:16 PM
Long-term archiving on : Wednesday, February 6, 2013 - 3:54:14 AM


Files produced by the author(s)


  • HAL Id : halshs-00748331, version 1



Michel Grabisch, Peter Sudhölter. On the restricted cores and the bounded core of games on distributive lattices. 2012. ⟨halshs-00748331⟩



Record views


Files downloads