Advanced Search
MyIDEAS: Login

Cost sharing in a job scheduling problem

Contents:

Author Info

  • MISHRA, Debasis
  • RANGARAJAN, Bharath

Abstract

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. 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://alfresco.uclouvain.be/alfresco/download/attach/workspace/SpacesStore/bbc74b68-5ffd-4762-9c8c-c0fedfd40636/coredp_2005_53.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 2005053.

as in new window
Length:
Date of creation: 00 Aug 2005
Date of revision:
Handle: RePEc:cor:louvco:2005053

Contact details of provider:
Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)
Phone: 32(10)474321
Fax: +32 10474304
Email:
Web page: http://www.uclouvain.be/core
More information through EDIRC

Related research

Keywords: queueing problems; Shapley value; cost sharing; job scheduling;

Other versions of this item:

Find related papers by JEL classification:

References

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.:
as in new window
  1. 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.
  2. Flip Klijn & Estela Sánchez, 2006. "Sequencing games without initial order," Computational Statistics, Springer, vol. 63(1), pages 53-62, February.
  3. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
  4. Roth,Alvin E. (ed.), 2005. "The Shapley Value," Cambridge Books, Cambridge University Press, number 9780521021333, October.
  5. Manipushpak Mitra, 2000. "Achieving the First Best in Sequencing Problems," Bonn Econ Discussion Papers bgse11_2001, University of Bonn, Germany.
  6. 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).
  7. Moulin, Herve, 1992. "An Application of the Shapley Value to Fair Division with Money," Econometrica, Econometric Society, vol. 60(6), pages 1331-49, November.
  8. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer, vol. 29(3), pages 369-382, October.
  9. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  10. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer, vol. 29(3), pages 369-382, October.
  2. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer, vol. 38(3), pages 473-480, March.
  3. Rene van den Brink & Youngsub Chun, 2010. "Balanced Consistency and Balanced Cost Reduction for Sequencing Problems," Tinbergen Institute Discussion Papers 10-035/1, Tinbergen Institute.
  4. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP).
  5. Alex Gershkov & Paul Schweinzer, 2006. "When Queuening is Better than Push and Shove," Bonn Econ Discussion Papers bgse10_2006, University of Bonn, Germany.
  6. Rene van den Brink & Youngsub Chun & Yuan Ju, 2014. "Auctioning and Selling Positions: A Non-cooperative Approach to Queuing Conflicts," Tinbergen Institute Discussion Papers 14-016/II, Tinbergen Institute.
  7. Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2005053. 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: (Alain GILLIS).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.