Algorithm Analysis and Game Theory Application in Networks

Algorithm Analysis and Game Theory Application in Networks

时间：2013年4月24日 地点：九龙湖校区计算机楼313室

报告简介：

Like in other areas, algorithm analysis and game theory related modeling can find their wide applications, e.g in computer networks. In this talk, we are introducing several possible ways of modeling some phenomena in networks, including isolation games, routing games and attacker-defender games. In each game, we discuss the study of Nash Equilibrium and related concepts like best response dynamic, price of anarchy and potential functions. We also discuss a linear coverage problem where possible ways of using algorithm analysis are introduced.

报告人简介：

Dr. Minming Li is an assistant professor in City University of Hong Kong. He received his bachelor's degree and Ph.D. from Tsinghua University in 2002 and 2006 respectively (Institute for Theoretical Computer Science (ITCS), headed by Andrew Yao). His major research interest includes algorithm design and analysis in energy efficient scheduling, wireless networks and algorithmic game theory. He has published 70 papers including 30 reputable journal papers like PNAS, SIAM Journal of Computing, IEEE Transactions on Moblie Computing and 40 conferences papers like INFOCOM, ICDCS and ISAAC. 李闽溟博士于2002与2006年在清华大学获得本科及博士学位，之后在香港城市大学任助理教授。他的研究兴趣包括调度与网络中的算法设计与分析，博弈论及机制设计。在PNAS, SIAM Journal of Computing, IEEE Transactions等国际期刊和INFOCOM, ICDCS, ISAAC等国际会议上发表文章70余篇。

计算机网络和信息集成教育部重点实验室（东南大学）