Congested assignment is the main topic of this lecture. Lecture 6 covered uncongested assignment, or simply assignment. After the introduction, a general network assignment problem is discussed. Network assignment variables and the relations between these variables are given. Thereafter, two assignment types are elaborated more thoroughly:

• Type 1. Deterministic user equilibrium assignment (DUE)
• Type 2. Stochastic user equilibrium assignment (SUE)

After the explanations of the two assignment types, special topics are covered. The lecture is concluded with a reprise discrete choice theory, where the definition of probit and logit assignment are elaborated.