Proportional scheduling, split-proofness and merge-proofness

Moulin, H. (2008) Proportional scheduling, split-proofness and merge-proofness. Games and Economic Behavior, 63(2), pp. 567-587. (doi:10.1016/j.geb.2006.09.002)

Full text not currently available from Enlighten.

Abstract

If shortest (respectively longest) jobs are served first, splitting a job into smaller jobs (respectively merging several jobs) can reduce the actual wait. Any deterministic protocol is vulnerable to strategic splitting and/or merging. This is not true if scheduling is random, and users care only about expected wait. The Proportional rule draws the job served last with probabilities proportional to size, then repeats among the remaining jobs. It is immune to splitting and merging. Among split-proof protocols constructed in this recursive way, it is characterized by either one of three properties: job sizes and delays are co-monotonic; total delay is at most twice optimal delay; the worst (expected) delay of any job is at most twice the smallest feasible worst delay. A similar result holds within the family of separable rules,

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Moulin, Professor Herve
Authors: Moulin, H.
College/School:College of Social Sciences > Adam Smith Business School > Economics
Journal Name:Games and Economic Behavior
Publisher:Elsevier
ISSN:0899-8256
ISSN (Online):1090-2473

University Staff: Request a correction | Enlighten Editors: Update this record