Abstract.
In the classical model of cooperative games, it is considered that each coalition of players can form and cooperate to obtain its worth. However, we can think that in some situations this assumption is not real, that is, all the coalitions are not feasible. This suggests that it is necessary to rise the whole question of generalizing the concept of cooperative game, and therefore to introduce appropriate solution concepts. We propose a model for games on a matroid, based in several important properties of this combinatorial structure and we introduce the probabilistic Shapley value for games on matroids.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: July 2000/Final version received: September 2000
Rights and permissions
About this article
Cite this article
Bilbao, J., Driessen, T., Jiménez Losada, A. et al. The Shapley value for games on matroids: The static model. Mathematical Methods of OR 53, 333–348 (2001). https://doi.org/10.1007/s001860100111
Issue Date:
DOI: https://doi.org/10.1007/s001860100111