讲座题目： Smooth Path-Following Methods for Refinements of Stationary Equilibrium in Stochastic Games and Applications

　　报告人：Chuangyin Dang(党创寅，香港城市大学)

　　报告时间：2018年9月11日(周二)上午9:00–10:30

　　报告地点：经管院B249

　　主办单位：管理科学与工程系

　　摘要:

　　Among forward-looking players in dynamic environments, stochastic games play a key role in the analysis of strategic interactions and have been applied in several areas including economics and finance. Stationary equilibrium is Nash equilibrium of stochastic games in stationary strategies. It is one of the most important ideas in stochastic games. Nevertheless, a stochastic game can have many stationary equilibria and some of these equilibria may be inconsistent with our intuitive notions about what should be the outcome of a stochastic game. To reduce this ambiguity and eliminate some of these counterintuitive stationary equilibria, we extend to stochastic games the concepts of proper equilibrium, perfect d-proper equilibrium and perfect equilibrium in strategic games. These extensions naturally result in strict refinements of stationary equilibrium and corresponding notions of proper stationary equilibrium, perfect d-proper stationary equilibrium and perfect stationary equilibrium. As a result of these refinements, numerical solutions are in demand for their applications. This talk will introduce recent developments on smooth path-following methods for the refinements of stationary equilibrium in stochastic games and their applications.

　　简介:

　　Prof. Chuangyin Dang received his PhD in Operations Research/Mathematical Economics from Tilburg University, Netherlands, in 1991. He currently is Acting Head and Professor in the Department of Systems Engineering and Engineering Management, City University of Hong Kong. Prior to this, Prof. Dang held faculty positions at University of California at Davis, Delft University of Technology, and University of Auckland, and was research fellow at the Cowles Foundation for Research in Economics, Yale University. He is best known for the invention of the D1-triangulation of the Euclidean space, the origination of simplicial path-following methods for integer programming, and the proof of PPAD-completeness of the well-known equal-sums problem (an open problem). Prof. Dang received Outstanding Research Achievements Award from Tilburg University in 1990. His research interests include game theory and applications, systems modeling and optimization, economics and computation, data analytics and machine learning.