Abstract
For sequencing problems, we identify the set of all mechanisms satisfying queue efficiency, strategy-proofness and budget balance. Such mechanisms are balanced VCG (or B-VCG) mechanisms up to an agent specific function that does not depend on the waiting cost of a concerned agent and for each problem these agent specific constants must add up to zero. The B-VCG mechanism is a generalization of the symmetrically balanced VCG mechanism analyzed in the queueing context. However, unlike its queueing counterpart, it fails to satisfy even the basic fairness requirement of equal treatment of equals.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
