Presented by: 
Werner Scheinhardt (University of Twente and UQ)
Date: 
Mon 22 Jul, 2:00 pm - 2:45 pm
Venue: 
Otto Hirschfeld Building 81-214

After a general introduction to a few research interests (including
so-called fluid queues) we will take a closer look at the following model.

We consider networks of queues in which the independent
operators of individual queues may cooperate to reduce the cost
of waiting. More specifically, we focus on so-called Jackson
networks in which the total capacity of the servers can be
redistributed over all queues in any desired way. If we associate
a cost to waiting that is linear in the queue lengths, it is known
how the operators should share the available service capacity to
minimize the long run total cost.

The main question we try to answer is whether or not (the
operators of) the individual queues will indeed cooperate in this
way, and if so, how they will share the cost in the new situation.