How to find Nash equilibrium in Congestion Game?

ferry k

New member
I want to find nash equilibrium in congestion game. Consider a network with source s and sink t, they are connected by 2 edges e1 and e2. Latency function are x in e1 and 1 in e2. I look at the answer, and it is said that by sending flow 1 unit through e1 and no flow through e2, we have Nash equilibrium. But I am sooo confused why this flow is equilibrium. Is it because we shall have same cost either go from e1 or e2?

Help me please...10 points for best answer!!!
 
Back
Top