Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Given a group of agents, the queueing problem is concerned with finding the order to serve agents and the monetary transfers they should receive. In this paper, we characterize interesting subfamilies of the VCG mechanisms by investigating the implications of either no-envy or solidarity requirements. First, we present a characterization of the strategy-proofand envy-freemechanisms. Next, we present characterizations of VCG mechanisms satisfying one of two different formulations of cost monotonicity or population monotonicity. Finally, we show that among the envy-free and strategy-proof mechanisms, the only ones that satisfy one of two formulations of cost monotonicity or population monotonicity are extensions of the pivotal or the reward-based pivotal mechanisms.