We need presenters

02Nov07

Hi everyone, it’s getting to the point where we need some volunteers to present in the upcoming weeks…

The presentations needn’t be about your research. We’re all learning this area, so taking a paper or two from the web page or a chapter (or half a chapter) from the book is all that we need.

And remember, the first 5 chapters of the book are online. Also, we have multiple copies on reserve at the library for people to use.

Here’re some idea’s that I think would make good topics, if you have others, just respond with them. Also, just respond if you want to claim a topic.

1) Chapter 4 in the book (on paying to receive higher priority)

2) Chapter 5 in the book (on models where users can renege and jockey between queues)

3) Applications of dynamic games in queues, by Eitan Altman - this has a few nice examples of simple models where game theory and queues interact.

4) Network Routing, Frank Kelly - this paper looks at a network of queues with user’s greedily choosing routes and characterizes the nash and social optimal.

5) The value of congestion, Laurens Debo, Christin Parlour, Uday Rajan & To Join the Shortest or the Longest Queue: Inferring Service Quality from Queue Lengths, Laurens Debo and Senthil Veeraraghavan - Laurens will be coming to Caltech later in the term, and has done some very nice work in this area illustrating “herding” in queueing models.

6) Queueing cost functions in congestion games - This is a little more up in the air, and maybe Ho-Lin will touch on this. But, most of the time congestion games results do not apply to queueing cost functions (1/(mu-lambda)), so it would be nice to find out exactly what has been shown for such cost functions. A starting point for this would be this paper by Tim Roughgarden or his book (which I have in my office if someone wants to borrow it)

Filed under: Uncategorized   |