On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
A deterministic server is shared by users with identical linear waiting costs, requesting jobs of arbitrary lengths. Shortest jobs are served first for efficiency. The server can monitor the length of a job but not the identity of the job’s user, thus merging, splitting, or partially transferring jobs offer cooperative strategic opportunities. Can we design cash transfers to neutralize such manipulations? We prove that mergeproofness and splitproofness are not compatible, and that it is similarly impossible to prevent all transfers of jobs involving three or more agents. On the other hand, robustness against pairwise transfers is feasible and essentially characterizes a one-dimensional set of scheduling methods. This line is borne by two outstanding methods: the merge-proof S + and the split-proof S - . Splitproofness, unlike mergeproofness, is not compatible with several simple tests of equity. Thus, the two properties are far from equally demanding.
Volume (Year): 32 (2007)
Issue (Month): 2 (May)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Maniquet, Francois, 2003.
"A characterization of the Shapley value in queueing problems,"
Journal of Economic Theory,
Elsevier, vol. 109(1), pages 90-103, March.
- MANIQUET, François, "undated". "A characterization of the Shapley value in queueing problems," CORE Discussion Papers RP 1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
- Kittsteiner, Thomas & Moldovanu, Benny, 2004. "Priority Auctions and Queue Disciplines that Depend on Processing Time," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 5, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August.
- Manipushpak Mitra & Roland Hain, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers bgse20_2001, University of Bonn, Germany.
- Moulin, Herve, 1985. "Egalitarianism and Utilitarianism in Quasi-linear Bargaining," Econometrica, Econometric Society, vol. 53(1), pages 49-67, January.
- Moulin Herve, 1984. "Egalitarianisme and utilitarianism in quasi-linear bargaining," CEPREMAP Working Papers (Couverture Orange) 8417, CEPREMAP.
- Biung-Ghi Ju, 2003. "Manipulation via merging and splitting in claims problems," Review of Economic Design, Springer;Society for Economic Design, vol. 8(2), pages 205-215, October.
- Friedman, Eric & Moulin, Herve, 1999. "Three Methods to Share Joint Costs or Surplus," Journal of Economic Theory, Elsevier, vol. 87(2), pages 275-312, August.
- Eric Friedman & Moulin, Herve, 1995. "Three Methods to Share Joint Costs or Surplus," Working Papers 95-38, Duke University, Department of Economics.
- M. Angeles de Frutos, 1999. "Coalitional manipulations in a bankruptcy problem," Review of Economic Design, Springer;Society for Economic Design, vol. 4(3), pages 255-272.
- SPRUMONT, Yves, 2004. "Aumann-Shapley Pricing: A Reconsideration of the Discrete Case," Cahiers de recherche 11-2004, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
- SPRUMONT, Yves, 2004. "Aumann-Shapley Pricing : A Reconsideration of the Discrete Case," Cahiers de recherche 2004-08, Universite de Montreal, Departement de sciences economiques.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
- Hamers, Herbert & Suijs, Jeroen & Tijs, Stef & Borm, Peter, 1996. "The Split Core for Sequencing Games," Games and Economic Behavior, Elsevier, vol. 15(2), pages 165-176, August.
- Hamers, H.J.M. & Suijs, J.P.M. & Tijs, S.H. & Borm, P.E.M., 1996. "The split core of sequencing games," Other publications TiSEM 28693e2d-82da-456a-909b-3, Tilburg University, School of Economics and Management.
- Manipushpak Mitra, 2001. "Mechanism design in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 17(2), pages 277-305.
- Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
- Manipushpak Mitra, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer;Society for Economic Design, vol. 7(1), pages 75-91.
- Manipushpak Mitra, 2000. "Achieving the First Best in Sequencing Problems," Bonn Econ Discussion Papers bgse11_2001, University of Bonn, Germany.
- Flip Klijn & Estela Sánchez, 2006. "Sequencing games without initial order," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 53-62, February.
- Flip Klijn & Estela S?chez, 2004. "Sequencing Games without Initial Order," UFAE and IAE Working Papers 622.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. Full references (including those not matched with items on IDEAS)