A cooperative game is defined on a set N of players. Each subset (coalition) S of N can gain in total a value v(S) by cooperating. For example, N might be the set of vertices of a graph and v(S) the maximum size matching in the subgraph induced by S. The problem in general is to allocate the total profit v(N) among the individual players in a ”fair” way. Several notions of fairness have been introduced in the literature. In the talk we address the corresponding computational problem of finding such fair allocations.