A new axiom, symmetry-based compromise, is introduced to study solutions to convex bargaining problems. It is shown that any efficient solution that is also scale invariant and satisfies symmetry-based compromise must be Nash.