Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We revisit two classic problems: the assignment problem, in which matched pairs of agents create value, and the bankruptcy problem, in which we need to share an endowment among agents with conflicting claims. Since Core Selection constrains us to exactly divide the value created by matched agents, the assignment problem corresponds to multiple two-player bankruptcy problems. From this we obtain equivalence between the Concede-and-Divide (Aumann and Maschler, 1985) sharing method for the bankruptcy problem and the Fair Division solution (Thompson, 1981) for the assignment problem.