Summary: Queueing phenomena, along with many related decision problems, are well known to all of us from daily situations. We often need to answer questions concerning whether to queue or not, where to queue, how long to queue etc. In networking applications, both in road traffic as well as in telecommunication networks, individuals or some central controllers are frequently faced with similar questions. These decisions have often to be taken in a randomly changing environment, in a decentralized way, and with partial information. This gives rise to many challenging problems in dynamic games. We shall describe in this overview some generic queueing problems (both static and dynamic) that require game theoretic models and solutions.
For the entire collection see [Zbl 1060.91001].