Cost sharing in a job scheduling problem
A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic characterization of the Shapley value rule by introducing some fairness axioms that are new in the literature. In the second part, we use linear programming duality to provide an alternate characterization of the Shapley value rule. Here, we use the idea of decomposition of transfers and the notion of pairwise no-envy allocation. Of the family of allocation rules that satisfy pairwise noenvy, the Shapley value rule is the one with the minimum sum of absolute values of transfers. We discuss no-envy rules and show that no-envy is not possible in general. If processing times of all jobs are equal, then it is possible to design no-envy rules, and we characterize all no-envy rules for this case.
|Date of creation:||00 Aug 2005|
|Contact details of provider:|| Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)|
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
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.:
- Hervé Moulin, 2007.
"On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs,"
Mathematics of Operations Research,
INFORMS, vol. 32(2), pages 266-283, May.
- Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
- 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, François, "undated". "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, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- 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.
- Hamers, Herbert & Suijs, Jeroen & Tijs, Stef & Borm, Peter, 1996. "The Split Core for Sequencing Games," Games and Economic Behavior, Elsevier, vol. 15(2), pages 165-176, August.
- Hamers, H.J.M. & Suijs, J.P.M. & Tijs, S.H. & Borm, P.E.M., 1996. "The split core of sequencing games," Other publications TiSEM 28693e2d-82da-456a-909b-3, Tilburg University, School of Economics and Management.
- Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
- MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," CORE Discussion Papers 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Moulin, Herve, 1992. "An Application of the Shapley Value to Fair Division with Money," Econometrica, Econometric Society, vol. 60(6), pages 1331-1349, November.
- Manipushpak Mitra, 2002. "Achieving the first best in sequencing problems," Review of Economic Design, Springer;Society for Economic Design, vol. 7(1), pages 75-91.
- Manipushpak Mitra, 2000. "Achieving the First Best in Sequencing Problems," Bonn Econ Discussion Papers bgse11_2001, University of Bonn, Germany.
- 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.
- Flip Klijn & Estela S?chez, 2004. "Sequencing Games without Initial Order," UFAE and IAE Working Papers 622.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June. Full references (including those not matched with items on IDEAS)