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

Minimizing the Worst Slowdown: Off-Line and On-Line

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

Minimizing the slowdown (expected sojourn time divided by job size) is a key concern of fairness in scheduling and queuing problems where job sizes are very heterogeneous. We look for protocols (service disciplines) capping the worst slowdown (called here liability) a job may face no matter how large (or small) the other jobs are. In the scheduling problem (all jobs released at the same time), allowing the server to randomize the order of service cuts almost in half the liability profiles feasible under deterministic protocols. The same statement holds if cash transfers are feasible and users have linear waiting costs.

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/slowdn6.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 2005-03.

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

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. Moulin, Herve, 1992. "Welfare bounds in the cooperative production problem," Games and Economic Behavior, Elsevier, vol. 4(3), pages 373-401, July. [Downloadable!] (restricted)
  2. Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society. [Downloadable!]
  3. 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:
  4. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics. [Downloadable!]
  5. Demko, Stephen & Hill, Theodore P., 1988. "Equitable distribution of indivisible objects," Mathematical Social Sciences, Elsevier, vol. 16(2), pages 145-158, October. [Downloadable!] (restricted)
  6. Moulin, Herve, 1991. "Welfare bounds in the fair division problem," Journal of Economic Theory, Elsevier, vol. 54(2), pages 321-337, August. [Downloadable!] (restricted)
    Other versions:
  7. Moulin, Herve, 1990. "Uniform externalities : Two axioms for fair allocation," Journal of Public Economics, Elsevier, vol. 43(3), pages 305-326, December. [Downloadable!] (restricted)
    Other versions:
  8. Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer, vol. 2(1), pages 193-209, December. [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!]
Statistics
Access and download statistics

Did you know? IDEAS also indexes book chapters.

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.