NASH EQUILIBRIUM IN NETWORKING GAMES
Prof., Dr.Sci., Director
Institute of Applied Mathematical Research,
Karelia Research Center, Russian Academy of Science
HIIT Ruoholahti, 6th floor, Wed 7.2.2007 10:00-11:00
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.
Last update: 6 Feb, 2007. Page content by: Martti Mäntylä.