Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We study the problem of allocating m identical items among n>m agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be burnt to support dominant-strategy implementation.