The core of games on ordered structures and graphs

Abstract : In cooperative games, the core is the most popular solution concept, and its properties are well known. In the classical setting of cooperative games, it is generally assumed that all coalitions can form, i.e., they are all feasible. In many situations, this assumption is too strong and one has to deal with some unfeasible coalitions. Defining a game on a subcollection of the power set of the set of players has many implications on the mathematical structure of the core, depending on the precise structure of the subcollection of feasible coalitions. Many authors have contributed to this topic, and we give a unified view of these different results.
Liste complète des métadonnées
Contributeur : Michel Grabisch <>
Soumis le : jeudi 21 mars 2013 - 14:19:45
Dernière modification le : mardi 27 mars 2018 - 11:48:05
Document(s) archivé(s) le : samedi 22 juin 2013 - 05:30:09


Fichiers produits par l'(les) auteur(s)




Michel Grabisch. The core of games on ordered structures and graphs. Annals of Operations Research, Springer Verlag, 2013, 204 (1), pp.33-64. 〈10.1007/s10479-012-1265-4〉. 〈hal-00803233〉



Consultations de la notice


Téléchargements de fichiers