A characterization of the symmetrically balanced VCG rule in the queueing problem

Abstract We characterize the symmetrically balanced VCG rule in the queueing problem using the axioms of outcome efficiency , budget balance , equal treatment of equals , Pareto indifference , together with a weakening of strategy-proofness , upward-invariance .