Topic: Network Game: Optimization and Equilibrium

Speaker: Hu Xudong

Abstract: Algorithmic game theory emerged at the end of the 20th century. It is a multidisciplinary research field involving game theory, computer science, economics and others. It features a profound theoretical foundation and a wide range of practical applications. The speaker will present part of the research results his group has achieved in algorithmic game theory in recent years, namely how to use the equilibrium idea of game to study four aspects in network optimization: minimizing the maximum delay selfish routing, load balancing selfish routing, server work scheduling, and Braess paradox.

Introduction of Speaker: Hu Xudong, researcher and doctoral tutor; the current chairman of Operations Research Society of China. He graduated from Tsinghua University in 1985 with a bachelor's degree in Applied Mathematics and later obtained a doctorate in Operations Research and Cybernetics in 1989 from the Institute of Applied Mathematics of the Chinese Academy of Sciences. Since 1989, he has been engaged in the theoretical research and teaching of Operations Research in the Chinese Academy of Sciences, oriented in combinatorial optimization, network games, and approximation algorithms. He was awarded the 5^th "National Excellent Worker in Science and Technology" In 2012 and the "Pollyanna Chu Outstanding Teacher of the Chinese Academy of Sciences" in 2016.

Inviter: Wang Guanghui, Professor of Mathematics School

Time: 15:00-16:00, March 7 (Thursday)

Venue: 924 Conference Hall, Block B of Zhixin Building, Central Campus

Organizer: Mathematics School of Shandong University