The Wardrop type of this situation is used when modeling traffic in congestion games. For 10 points each:
[10e] Name this situation. A type of this situation in which no agent can gain by unilaterally changing strategy is named for John Nash.
ANSWER: equilibrium [accept Wardrop equilibrium or Nash equilibrium]
[10h] Acemoğlu (“ah-sem-OH-gloo”) et al. used Wardrop equilibrium to analyze an informational form of this eponymous paradox, in which adding a road to a road network with a fixed number of drivers may result in longer journey times overall.
ANSWER: Braess’s (“brass’s”) paradox [accept informational Braess’s paradox]
[10m] Modeling traffic over the Soviet rail network was the original motivation for the formulation of this optimization problem, the subject of the Ford–Fulkerson algorithm. The value of solutions to this problem is equal to the capacity of the minimum cut.
ANSWER: maximum flow problem [or max-flow problem; prompt on network flow problem]
<Editors, Other Science>