From a certain place K, 2000 people set off for work in the distant place S in the morning by car. Each of the drivers must decide whether to come to place S via point G or via point D (see the directed graph below). The travel time on segments G-S and K-D is not dependent on the number of drivers: each driver traverses the G-S segment in 60 minutes, and the K-D segment in 45 minutes, regardless of the number of drivers. However, the travel time on segments K-G and D-S depends on the number of drivers: if x drivers travel on the K-G segment, each driver on this segment consumes 0.005x minutes; if x drivers travel on the D-S segment, each driver on this segment consumes 0.01x minutes (see the directed graph below). Assume that all people start simultaneously and do not know the decisions of other people. Find all pure Nash equilibria of the game.
Step by step
Solved in 1 steps
