Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Moulin, Herve

    (Rice U)

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

If you experience problems downloading a file, check if you have the proper application to view it first. 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
Download Restriction: no

Bibliographic Info

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

as in new window
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

Related research

Keywords:

References

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.:
as in new window
  1. MANIQUET, François, . "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).
  2. 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.
  3. Manipushpak Mitra & Roland Hain, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers bgse20_2001, University of Bonn, Germany.
  4. Manipushpak Mitra, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer, vol. 7(1), pages 75-91.
  5. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
  6. 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.
  7. Moulin, Herve, 1985. "Egalitarianism and Utilitarianism in Quasi-linear Bargaining," Econometrica, Econometric Society, vol. 53(1), pages 49-67, January.
  8. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  9. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
  10. 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.
  11. M. Angeles de Frutos, 1999. "Coalitional manipulations in a bankruptcy problem," Review of Economic Design, Springer, vol. 4(3), pages 255-272.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. 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).
  2. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
  3. 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).

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:ecl:riceco:2004-04. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.