Split-Proof Probabilistic Scheduling
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.
|Date of creation:||Mar 2005|
|Date of revision:|
|Contact details of provider:|| Postal: MS-22, 6100 South Main, Houston, TX 77005-1892|
Phone: (713) 527-4875
Fax: (713) 285-5278
Web page: http://www.ruf.rice.edu/~econ/papers/index.html
More information through EDIRC
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.:
- 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.
- Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
- Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
- Hervé Moulin, 2002.
"The proportional random allocation of indivisible units,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 381-413.
- Moulin, Herve, 2000. "The Proportional Random Allocation of Indivisible Units," Working Papers 2000-02, Rice University, Department of Economics.
- Moulin, Herve, 1994. "Social choice," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 31, pages 1091-1125 Elsevier.
- Manipushpak Mitra, 2000.
"Achieving the First Best in Sequencing Problems,"
Bonn Econ Discussion Papers
bgse11_2001, University of Bonn, Germany.
- Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
- Moulin Herve, 1984.
"Egalitarianisme and utilitarianism in quasi-linear bargaining,"
CEPREMAP Working Papers (Couverture Orange)
- Moulin, Herve, 1985. "Egalitarianism and Utilitarianism in Quasi-linear Bargaining," Econometrica, Econometric Society, vol. 53(1), pages 49-67, January.
- Moulin, Herve & Sprumont, Yves, 2003.
"On Demand Responsiveness in Additive Cost Sharing,"
2003-10, Rice University, Department of Economics.
- 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).
- Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- Manipushpak Mitra & Roland Hain, 2001.
"Simple Sequencing Problems with Interdependent Costs,"
Bonn Econ Discussion Papers
bgse20_2001, University of Bonn, Germany.
- Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August.
- Sprumont, Yves, 1998.
"Ordinal Cost Sharing,"
Journal of Economic Theory,
Elsevier, vol. 81(1), pages 126-162, July.
- Manipushpak Mitra, 2000.
"Mechanism Design in Queueing Problems,"
Econometric Society World Congress 2000 Contributed Papers
1301, Econometric Society.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- M. Angeles de Frutos, 1999. "Coalitional manipulations in a bankruptcy problem," Review of Economic Design, Springer;Society for Economic Design, vol. 4(3), pages 255-272.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
- Flip Klijn & Estela Sánchez, 2006.
"Sequencing games without initial order,"
Mathematical Methods of Operations Research,
Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 53-62, February.
- Biung-Ghi Ju, 2003. "Manipulation via merging and splitting in claims problems," Review of Economic Design, Springer;Society for Economic Design, vol. 8(2), pages 205-215, October.
- 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.
- Moulin, Herve & Stong, Richard, 2001. "Fair Queuing and Other Probabilistic Allocation Methods," Working Papers 2000-09, Rice University, Department of Economics.
When requesting a correction, please mention this item's handle: RePEc:ecl:riceco:2004-06. 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 references are entirely missing, you can add them using this form.