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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00803233
Contributor : Michel Grabisch <>
Submitted on : Thursday, March 21, 2013 - 2:19:45 PM
Last modification on : Tuesday, March 27, 2018 - 11:48:05 AM
Long-term archiving on : Saturday, June 22, 2013 - 5:30:09 AM

Files

aor12-survey.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

337

Files downloads

3373