Values for games on matroids

In this chapter we will consider feasible coalitions of players by using a class of combinatorial geometries called matroids. Let us assume that there are two rules of cooperation between players: If a coalition can form, then any subcoalition is also feasible. In general, the players that take part in the formation of a coalition have common interests. Therefore, any subset of these players have at least the same common interests. If there are two coalitions where the cardinal differs in one element, a player of the largest can join with the smallest making a feasible coalition.