Submitted by mam on February 7, 2007 - 00:00
NASH EQUILIBRIUM IN NETWORKING GAMES
Vladimir Mazalov
Prof., Dr.Sci., Director
http://wwwold.krc.karelia.ru/HP/mazalov/index.en.html
Institute of Applied Mathematical Research,
Karelia Research Center, Russian Academy of Science
HIIT Ruoholahti, 6th floor, Wed 7.2.2007 10:00-11:00
Abstract:
We consider non-cooperative games related to networks. One problem here is the optimal arrival time choice for a service. We analyze the case of two and more customers and asymptotics of an optimal solution. Another problem is the optimal routing in networks of special and general forms. Wardrope equilibrium and KP models are analysed. We considered the Braess paradox and found the conditions for its existence. In general networks we find the potential function and use it to construct the Nash equilibrium. Some examples in real networks are presented.
Vladimir Mazalov
Prof., Dr.Sci., Director
http://wwwold.krc.karelia.ru/HP/mazalov/index.en.html
Institute of Applied Mathematical Research,
Karelia Research Center, Russian Academy of Science
HIIT Ruoholahti, 6th floor, Wed 7.2.2007 10:00-11:00
Abstract:
We consider non-cooperative games related to networks. One problem here is the optimal arrival time choice for a service. We analyze the case of two and more customers and asymptotics of an optimal solution. Another problem is the optimal routing in networks of special and general forms. Wardrope equilibrium and KP models are analysed. We considered the Braess paradox and found the conditions for its existence. In general networks we find the potential function and use it to construct the Nash equilibrium. Some examples in real networks are presented.
Events:
Last updated on 6 Feb 2007 by Martti Mäntylä - Page created on 7 Feb 2007 by Martti Mäntylä