# 11-124/2 (2011-09-02)

Sander Muns, Erasmus University Rotterdam, and CPB, The Hague
Shapley value, computational complexity, bipartition
JEL codes:

We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows linearly in the number of players, which contrasts with the usual exponential increase. Our result remains true when we introduce (i) randomization of the bipartition, and (ii) randomly draw a characteristic function.