Archive for November, 2007

Ho-Lin gave a nice overview of the stackelberg scheduling problem today… We looked at the same parallel link model we discussed at the end of the last class, and we saw that if alpha percent of the flow is controlled centrally, then the PoA is bounded by 1/alpha regardless of the latency function. [...]


I thought we went over some interesting results today…and our discussion turned out so provide some nice intuition about the contrast beween the behavior of a monopoly in the observable and the unobservable models.
If anyone missed class and would like to look over my notes before next time, just drop by my office.
A couple of [...]


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 [...]


Naor’s model

02Nov07

We just saw our first example of a simple interaction between game theory and queueing theory. Naor’s model takes probably the most basic model from the two setting and combines them. But, I think we could already learn a lot from the comparison.
One question that came up is that of “how far the [...]