Skip To Content

Athabasca University

Section 7: Congestion Games

Key Learning Points

  • Explain the concept of congestion games and their theoretical properties.
  • Define the concept of nonatomic congestion games.
  • Define other useful concepts, such as selfish routing, the price of anarchy, and Stackelberg routing.

Activities

  1. Read Section 6.4 of the text.
  2. Read Congestion Games, by Kevin Leyton-Brown.
  3. Do the following exercises:
    1. Represent the Santa Fe Bar problem as a congestion game.
    2. Run the NetLogo Minority Game model and do “Things to try” and “Extending the model.”

Updated July 09 2018 by FST Course Production Staff