Séminaire Phare


On Nash Equilibrium, Wardrop's Principles, Selfish Routing, and Optimal Routing

Tuesday, June 2, 2015
Speaker(s) : MEDHI Deep (University of Missouri-Kansas-City)

Nash equilibrium refers to the solution in a non-cooperative game with two or more players, while Wardrop addressed traffic equilibrium in road transportation networks by postulating two principles. How are they related to selfish routing and optimal routing in communication networks? In this talk, I'll discuss their connections through a link-latency function and illustrate where selfish routing and optimal routing come close and veer apart based on the link-latency function of choice.

More details here …
stefano.secci (at) nulllip6.fr