In the classical model of cooperative games, it is considered that each coa
lition of players can form and cooperate to obtain its worth. However, we c
an 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 th
erefore to introduce appropriate solution concepts. We propose a model for
games on a matroid, based in several important properties of this combinato
rial structure and we introduce the probabilistic Shapley value for games o
n matroids.