The core of games on ordered structures and graphs
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.
|Date of creation:||Oct 2009|
|Date of revision:|
|Publication status:||Published, 4OR : A Quarterly Journal of Operations Research, 2009, 7, 3, 207-238|
|Note:||View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00445171|
|Contact details of provider:|| Web page: http://hal.archives-ouvertes.fr/ |
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- repec:ner:tilbur:urn:nbn:nl:ui:12-154855 is not listed on IDEAS
When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00445171. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD)
If references are entirely missing, you can add them using this form.