Software

Routing Games in the Many Players Regime

Free registration required

Executive Summary

The paper has established the convergence of the Nash equilibrium in routing games to the Wardrop equilibrium as the number of players grows. The result was obtained under diagonal strict convexity assumption. The authors extend this result and establish the convergence under weaker convexity assumptions (the B type cost structure). The paper has established the convergence of the Nash equilibrium in routing games to the Wardrop equilibrium as the number of players grows. The proof makes use of an assumption on diagonal strict convexity introduced.

  • Format: PDF
  • Size: 303.46 KB