Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Nash solutions for two-player bargaining problems with non-convexity are shown to be dictatorial selections of Nash product maximizers in recent literature. In this paper we show that these solutions are implementable as unique subgame perfect equilibrium payoff allocations of a sequential game.