Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We study the second best in a single unit sale to two bidders. This is the allocation that maximizes the expected social surplus subject to the biddersʼ incentive compatible constraints when the first best is not implementable. We prove that Maskinʼs (1992) result that any first best allocation that is deterministic and monotone can be implemented with the English auction carries over to the second best.