caa a22 4500 463173988 CHVBK 20180406164821.0 cr unu---uuuuu 170326e20071001xx s 000 0 eng 10.1007/s00355-006-0210-3 doi (NATIONALLICENCE)springer-10.1007/s00355-006-0210-3 Cost sharing in a job scheduling problem [Elektronische Daten] [Debasis Mishra, Bharath Rangarajan] A set of jobs need to be served by a server which can serve only one job at a time. Every job has a processing time and incurs cost due to waiting (linear in its waiting time). The jobs share their costs using monetary transfers. We provide an axiomatic characterization of the Shapley value solution for this problem. Springer-Verlag, 2006 Mishra Debasis Planning Unit, Indian Statistical Institute, 7, S.J.S. Sansanwal Marg, 110 016, New Delhi, India aut Rangarajan Bharath Department of Mechanical Engineering, University of Minnesota, Minneapolis, MN, USA aut Social Choice and Welfare Springer-Verlag 29/3(2007-10-01), 369-382 0176-1714 29:3<369 2007 29 355 https://doi.org/10.1007/s00355-006-0210-3 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00355-006-0210-3 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Mishra Debasis Planning Unit, Indian Statistical Institute, 7, S.J.S. Sansanwal Marg, 110 016, New Delhi, India aut NATIONALLICENCE 700 1- Rangarajan Bharath Department of Mechanical Engineering, University of Minnesota, Minneapolis, MN, USA aut NATIONALLICENCE 773 0- Social Choice and Welfare Springer-Verlag 29/3(2007-10-01), 369-382 0176-1714 29:3<369 2007 29 355 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer