I have a problem with the derivation of a bankruptcy problem as given here on the page 199 which was computed in a Matlab program with $E=11$ and $d=(10,20,30).$ How was derived the game $(0,0,0,0,0,1,11)$ here ? I believe that the coalitions are ordered like this: $1,2,3,12,23,13,123.$
