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. 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.