Autonomous coalitions

Abstract : We consider in this paper solutions for TU-games where it is not assumed that the grand coalition is necessarily the final state of cooperation. Partitions of the grand coalition, or balanced collections together with a system of balancing weights interpreted as a time allocation vector are considered as possible states of cooperation. The former case corresponds to the c-core, while the latter corresponds to the aspiration core or d-core, where in both case, the best configuration (called a maximising collection) is sought. We study maximising collections and characterize them with autonomous coalitions, that is, coalitions for which any solution of the d-core yields a payment for that coalition equal to its worth. In particular we show that the collection of autonomous coalitions is balanced, and that one cannot have at the same time a single possible payment (core element) and a single possible configuration. We also introduce the notion of inescapable coalitions, that is, those present in every maximising collection. We characterize the class of games for which the sets of autonomous coalitions, vital coalitions (in the sense of Shellshear and Sudhölter), and inescapable coalitions coincide, and prove that the set of games having a unique maximising coalition is dense in the set of games.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download
Contributor : Michel Grabisch <>
Submitted on : Monday, November 30, 2015 - 2:08:08 PM
Last modification on : Thursday, November 21, 2019 - 2:06:04 AM
Long-term archiving on : Tuesday, March 1, 2016 - 1:30:45 PM


Files produced by the author(s)


  • HAL Id : halshs-01235632, version 1


Stéphane Gonzalez, Michel Grabisch. Autonomous coalitions. Annals of Operations Research, Springer Verlag, 2015. ⟨halshs-01235632⟩



Record views


Files downloads