Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency

We consider a relationship between equity and efficiency in queueing problems. We show that under strategy-proofness, anonymity in welfare implies queue-efficiency. Furthermore, by combining the result of Kayı and Ramaekers (Games Econ Behav 68:220–232, 2010) with ours, we also give a characterization of the class of rules that satisfy strategy-proofness, anonymity in welfare, and budget-balance.

[1]  J. Suijs.  On incentive compatibility and budget balancedness in public decision making , 1996 .

[2]  Yves Sprumont.  The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule , 1991 .

[3]  Lars-Gunnar Svensson.  Large Indivisibles: An analysis with respect to price equilibrium and fairness , 1983 .

[4]  Youngsub Chun,et al.  Consistency and monotonicity in sequencing problems , 2011, Int. J. Game Theory.

[5]  François Maniquet,et al.  A characterization of the Shapley value in queueing problems , 2003, J. Econ. Theory.

[6]  Shigehiro Serizawa,et al.  Strategy-Proof and Anonymous Allocation Rules of Indivisible Goods: A New Characterization of Vickrey Allocation Rule , 2006 .

[7]  Youngsub Chun,et al.  A pessimistic approach to the queueing problem , 2006, Math. Soc. Sci..

[8]  Itai Ashlagi,et al.  Characterizing Vickrey allocation rule by anonymity , 2011, Soc. Choice Welf..

[9]  Debasis Mishra,et al.  Cost sharing in a job scheduling problem , 2005, Soc. Choice Welf..

[10]  Manipushpak Mitra,et al.  Achieving the first best in sequencing problems , 2002 .

[11]  Kazutoshi Ando,et al.  Strategy-proof and symmetric allocation of an indivisible good , 2008, Math. Soc. Sci..

[12]  Manipushpak Mitra,et al.  Incomplete information and multiple machine queueing problems , 2005, Eur. J. Oper. Res..

[13]  H. Moulin.  Characterizations of the pivotal mechanism , 1986 .

[14]  Youngsub Chun,et al.  Queueing Problems with Two Parallel Servers , 2007 .

[15]  Bengt Holmstrom,et al.  GROVES' SCHEME ON RESTRICTED DOMAINS , 1979 .

[16]  Manipushpak Mitra.  Mechanism design in queueing problems , 2001 .

[17]  Manipushpak Mitra,et al.  Group strategyproofness in queueing models , 2011, Games Econ. Behav..

[18]  Jay Sethuraman,et al.  Cooperation in Queues , 2006 .

[19]  R. Dolan.  Incentive mechanisms for priority queuing problems , 1978 .

[20]  Manipushpak Mitra,et al.  Simple sequencing problems with interdependent costs , 2004, Games Econ. Behav..

[21]  M. Jackson,et al.  Strategy-Proof Exchange , 1995 .

[22]  Çagatay Kayi,et al.  Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems , 2010, Games Econ. Behav..

[23]  Debasis Mishra,et al.  Cost sharing in a job scheduling problem using the Shapley value , 2005, EC '05.

[24]  Youngsub Chun,et al.  No-envy in queueing problems , 2006 .