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! ]

Split-Proof Probabilistic Scheduling

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

If shortest jobs are served first, splitting a long job into smaller jobs reported under different aliases can reduce the actual wait until completion. If longest jobs are served first, the dual maneuver of merging several jobs under a single reported identity is profitable. Both manipulations can be avoided if the scheduling order is random, and users care only about the expected wait until completion of their job. The Proportional rule stands out among rules immune to splitting and merging. It draws the job served last with probabilities proportional to size, then repeats among the remaining jobs. Among split-proof scheduling rules constructed in this recursive way, it is characterized by either one of the three following properties: an agent with a longer job incurs a longer delay; total expected delay is at most twice optimal delay; the worst expected delay of any single job is at most twice the smallest feasible worst delay. A similar result holds within the natural family of separable rules.

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/2005papers/prosched19.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-06.

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

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:

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. M. Angeles de Frutos, 1999. "Coalitional manipulations in a bankruptcy problem," Review of Economic Design, Springer, vol. 4(3), pages 255-272. [Downloadable!] (restricted)
  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. Sprumont, Yves, 1998. "Ordinal Cost Sharing," Journal of Economic Theory, Elsevier, vol. 81(1), pages 126-162, July. [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. Fishburn, Peter C., 1992. "Induced binary probabilities and the linear ordering polytope: a status report," Mathematical Social Sciences, Elsevier, vol. 23(1), pages 67-80, February. [Downloadable!] (restricted)
  6. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society. [Downloadable!]
  7. 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:
  8. Hervé Moulin, 2002. "The proportional random allocation of indivisible units," Social Choice and Welfare, Springer, vol. 19(2), pages 381-413. [Downloadable!] (restricted)
    Other versions:
  9. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics. [Downloadable!]
  10. 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!]
  11. Moulin, Herve, 1985. "Egalitarianism and Utilitarianism in Quasi-linear Bargaining," Econometrica, Econometric Society, vol. 53(1), pages 49-67, January. [Downloadable!] (restricted)
    Other versions:
  12. Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics. [Downloadable!]
  13. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics. [Downloadable!]
  14. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. [Downloadable!] (restricted)
  15. Moulin, Herve & Sprumont, Yves, 2003. "On Demand Responsiveness in Additive Cost Sharing," Working Papers 2003-10, Rice University, Department of Economics. [Downloadable!]
    Other versions:
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. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics. [Downloadable!]
Statistics
Access and download statistics

Did you know? RePEc also has a blog.

This page was last updated on 2009-10-18.

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.