Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
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.