On scheduling fees to prevent merging, splitting, and transferring of jobs

Mathematics of Operations Research

Volumn 32, Issue 2, 2007, Pages 266-283

  Moulin, Hervé ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

Linear waiting cost; Merging; Queuing; Scheduling; Splitting; Transferring

Indexed keywords

LINEAR WAITING COST; SPLITTING;

ROBUSTNESS (CONTROL SYSTEMS); SET THEORY; USER INTERFACES;

SCHEDULING;

EID: 38549166362     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0239     Document Type: Article

References (32)

1. Aczél, J. 1996. Lectures on Functional Equations and Their Applications. Academic Press, New York.
2. Banker, R. 1981. Equity consideration in traditional full-cost allocation practices: An axiomatic perspective. S. Moriarty, ed. Joint Cost Allocations, University of Oklahoma, Norman, OK, 110-130.
3. Chun, Y. 2000. Agreement, separability, and other axioms for quasi-linear social choice problems. Soc. Choice and Welfare 17 507-521.
4. Chun, Y. 2004. Consistency and monotonicity in sequencing problems. Working paper, Seoul National University, Seoul, Korea.
5. Chun, Y. 2006. A pessimistic approach to the queuing problem. Math. Soc. Sci. 51(2) 171-181.
6. de Frutos, M. A. 1999. Coalitional manipulations in a bankruptcy problem. Rev. Econom. Design 4 255-272.
7. Dolan, R. 1978. Incentive mechanisms for priority queueing problems. Bell J. Econom. 9 421-436.
8. Douceur, J. 2002. The sybil attack. Proc. 1st Internat. Workshop on Peer-to-Peer Systems, Cambridge, MA, March 7-8, 2002, Lecture Notes in Computer Science, Vol. 2429, Springer, Berlin/Heidelberg, Germany, 251-260.
9. Ermolov, A. 1995. Coalitional manipulation in a quasi-linear economy. Games and Econom. Behav. 8 349-363.
10. Friedman, E., H. Moulin. 1999. Three methods to share joint costs or surplus. J. Econom. Theory 87(2) 275-312.
11. Hain, R., M. Mitra. 2004. Simple sequencing problems with interdependent costs. Games and Econom. Behav. 48 271-291.
12. Hamers, H., I. Curiel, F. Klijn. 2002. Sequencing games: A survey. P. Borm, H. Peters, eds. Game Theory in Honor of Stef Tijs. Kluwer Academic Publishers, Boston, MA, 27-50.
13. Ju, B. G. 2003. Manipulations via merging and splitting in claims problems. Rev. Econom. Design 8 205-215.
14. Katta, A., J. Sethuraman. 2004. A note on cooperation in queues. Working paper, Columbia University, New York.
15. Kittsteiner, T., B. Moldovanu. 2003. Auction-based queue disciplines. Working paper, University of Bonn, Bonn, Germany.
16. Kittsteiner, T., B. Moldovanu. 2005. Priority auctions and queue disciplines that depend on processing time. Management Sci. 51(2) 236-248.
17. Klijn, F., E. Sánchez. 2005. Sequencing games without a completely specific initial order. Reports in Statistics and Operations Research Report 02-04, 1-17.
18. Maniquet, F. 2003. A characterization of the Shapley value in queueing problems. J. Econom. Theory 109(1) 90-103.
19. Mendelson, H., S. Whang. 1990. Optimal incentive compatible priority pricing for the M/M/1 queue. Oper. Res. 38 870-883.
20. Mitra, M. 2001. Mechanism design in queueing problems. Econom. Theory 17 277-305.
21. Mitra, M. 2002. Achieving the first best in sequencing problems. Rev. Econom. Design 7 75-91.
22. Miyagawa, E., B. G. Ju, T. Sakai. 2007. Non-manipulable division rules in claim problems and generalizations. J. Econom. Theory. 132(1) 1-26.
23. Moulin, H. 1985. Egalitarianism and utilitarianism in quasi-linear bargaining. Econometrica 53(1) 49-67.
24. Moulin, H. 1987. Equal or proportional division of a surplus, and other methods. Internat. J. Game Theory 16(3) 161-186.
25. Moulin, H. 2004. Proportional scheduling, split-proofness and merge-proofness. Games and Econom. Behav. In press.
26. Moulin, H. 2005. Minimizing the worst slowdown: Offline, online. J. Oper. Res. In press.
27. Pederzoli, G., I. Curiel, S. Tijs. 1989. Sequencing games. Eur. J. Oper. Res. 40 344-351.
28. Potters, J., V. Rajendra Prasad, S. Tijs, I. Curiel, B. Veltman. 1993. Cooperation in one machine scheduling. Methods Oper. Res. 38 113-131.
29. Smith, W. 1956. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
30. Sprumont, Y. 2005. On the discrete version of the Aumann-Shapley cost-sharing method. Econometrica 73 1693-1712.
31. Suijs, J. 1996. On incentive compatibility and budget balancedness in public decision making. Econom. Design 2 193-209.
32. Suijs, J., S. Tijs, H. Hamers, P. Borm. 1996. The split core for sequencing games. Games and Econom. Behav. 15 165-176.