On the restricted cores and the bounded core of games on distributive lattices - HAL Accéder directement au contenu
Article dans une revue European Journal of Operational Research Année : 2014

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

Résumé

A game with precedence constraints is a TU game with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core, which is the union of all bounded faces of the core, proves to be a useful solution concept in the framework of games with precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a face of the core. A collection of coalitions is called normal if its resulting face is bounded. The bounded core is the union of all faces corresponding to minimal normal collections. We show that two faces corresponding to distinct normal collections may be distinct. Moreover, we prove that for superadditive games and convex games only intersecting and nested minimal collection, respectively, are necessary. Finally, it is shown that the faces corresponding to pairwise distinct nested normal collections may be pairwise distinct, and we provide a means to generate all such collections.
Fichier principal
Vignette du fichier
restrictedcore3R1-p.pdf ( 201.13 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-00950109, version 1 (20-02-2014)

Identifiants

Citer

Michel Grabisch, Peter Sudhölter. On the restricted cores and the bounded core of games on distributive lattices. European Journal of Operational Research, 2014, 235 (3), pp.709-717. ⟨10.1016/j.ejor.2013.10.027⟩. ⟨halshs-00950109⟩
316 Consultations
334 Téléchargements
Dernière date de mise à jour le 20/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus