We’ve now covered the basics of game theory and queueing, so we’re ready to get started looking at interactions next week…

The congestion games Jason introduced today will come up very frequently in our meetings, so it’ll be good to look over some of the papers on them if you haven’t seen them before.

A good starting point is Selfish Routing and the Price of Anarchy, Tim Roughgarden, which is available off of his web page.

Anyone else know some good background references on this stuff? If so, post them in a comment…

For the next meeting, it’ll be good to give yourself a quick refresher on Markov chains (which Mani didn’t have time to cover much in the first meeting).



2 Responses to “Comments on the 2nd meeting”  

  1. 1 Adam

    Ho-Lin has volunteered to give a follow-up on this material in a few weeks, so we’ll see a lot more about congestion games then.

  2. 2 Gail

    link to “On the Performance of Congestion Games for Optimum Satisfiability Problem”
    http://hal.archives-ouvertes.fr/docs/00/17/90/13/PDF/cahierLamsade266.pdf


Leave a Reply