On the core of cooperative queueing games

On the core of cooperative queueing games

0.00 Avg rating0 Votes
Article ID: iaor20119268
Volume: 39
Issue: 5
Start Page Number: 385
End Page Number: 389
Publication Date: Sep 2011
Journal: Operations Research Letters
Authors: , ,
Keywords: queueing systems
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.