This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Moulin, Herve (Rice U)

Additional information is available for the following registered author(s):

Abstract

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 its user, thus merging, splitting or partially transferring jobs offer cooperative strategic opportunities. Can we design cash transfers to neutralize such manipulations? We prove that merge-proofness and split-proofness are not compatible, and that it is similarly impossible to prevent all transfers of jobs involving three agents or more. On the other hand, robustness against pair-wise transfers is feasible, and essentially characterize 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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://www.ruf.rice.edu/~econ/papers/2004papers/schedfees4.pdf
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by Rice University, Department of Economics in its series Working Papers with number 2004-04.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: May 2004
Date of revision:
Handle: RePEc:ecl:riceco:2004-04

Contact details of provider:
Postal: MS-22, 6100 South Main, Houston, TX 77005-1892
Phone: (713) 527-4875
Fax: (713) 285-5278
Email:
Web page: http://www.ruf.rice.edu/~econ/papers/index.html
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords:

Other versions of this item:

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.:
  1. 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. [Downloadable!] (restricted)
    Other versions:
  2. Manipushpak Mitra, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer, vol. 7(1), pages 75-91. [Downloadable!] (restricted)
    Other versions:
  3. 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. [Downloadable!] (restricted)
  4. Manipushpak Mitra & Roland Hain, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers bgse20_2001, University of Bonn, Germany. [Downloadable!]
    Other versions:
  5. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society. [Downloadable!]
  6. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March. [Downloadable!] (restricted)
    Other versions:
  7. Thomas Kittsteiner & Benny Moldovanu, 2004. "Priority Auctions and Queue Disciplines that Depend on Processing Time," Discussion Papers 5, SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich. [Downloadable!]
  8. Moulin, Herve, 1985. "Egalitarianism and Utilitarianism in Quasi-linear Bargaining," Econometrica, Econometric Society, vol. 53(1), pages 49-67, January. [Downloadable!] (restricted)
    Other versions:
  9. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics. [Downloadable!]
  2. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer, vol. 29(3), pages 369-382, October. [Downloadable!] (restricted)
  3. Heydenreich, Birgit & Mishra, Debasis & Müller, Rudolf & Uetz, Marc, 2008. "Optimal Mechanisms for Single Machine Scheduling," Research Memoranda 033, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization. [Downloadable!]
  4. MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," CORE Discussion Papers 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE). [Downloadable!]
  5. JU, Biung-Ghi & MORENO-TERNERO, Juan D., 2006. "Progressivity, inequality reduction and merging-proofness in taxation," CORE Discussion Papers 2006075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE). [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? IDEAS was sponsored from 1997 to 2002 by the Université du Québec à Montréal.

This page was last updated on 2009-11-14.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.