報告簡介:
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餘篇。