|Start Page Number:||385|
|End Page Number:||389|
|Publication Date:||Sep 2011|
|Journal:||Operations Research Letters|
|Authors:||Wang Qiong, Reiman Martin I, zen Ulas|
We define some cooperative games in queueing systems as ‘single‐attribute games’. Such games have non‐empty cores if their characteristic functions are elastic. Moreover, the core contains a population monotonic allocation. The above properties apply to many games in Erlang B and C systems. Games with non‐elastic characteristic functions may have an empty core.