Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142653 | Operations Research Letters | 2013 | 4 Pages |
Abstract
We construct a cooperative staffing game to investigate how to fairly allocate a reduced number of staff among multiple call centers that pool (centralize) their capacities. We show that this game is essential and submodular, and, thereby, convex with a non-empty core. We also propose a neat Shapley value-characterized staff-allocation rule, which exists in the core of the game.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pengfei Guo, Mingming Leng, Yulan Wang,