Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.