Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We consider a non-cooperative assignment model where we show that any subgame perfect equilibrium is stable, and that an appropriate refinement criterion leads to the p-optimal outcome. We then consider a model with reneging and derive some interesting properties of this game. We show that in this case `unraveling' may occur. Furthermore, the resulting outcome can be either stable, or unstable.