Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We use the Lorenz criterion to select new allocation rules for the queueing problem. We first show that the Lorenz criterion selects a unique rule from four distinct subsets of Pareto efficient allocation rules satisfying some fairness concept. We then compare these four rules whenever possible. When we cannot compare, we use the lexicographic maximin and the lexicographic minimax criteria to make a comparison. However, a Lorenz optimal rule does not exist on the set of Pareto efficient and strategy-proof rules.