We consider a multi-player, cooperative, transferable-utility, symmetric game (N, ) and associated convex covers, i.e., convex games (N, ~) such that ~ \geq . A convex cover is efficient iff ~(∅) = (∅) and ~(N) = (N); and minimal iff there is no convex cover ~ \neq ~ such that ~ \leq ~....