- Seminar Calendar
- Seminar Archive
- 2025-2026 Semester 2
- 2025-2026 Semester 1
- 2024-2025 Semester 2
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
Extensive-Form Games: Nash Equilibrium and Its Refinements, Characterizations, and Differentiable Path-Following Methods
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, May 8, 2026, 16:30 pm to 17:30 pm HKT
Venue: ERB513, The Chinese University of Hong Kong
Title: Extensive-Form Games: Nash Equilibrium and Its Refinements, Characterizations, and Differentiable Path-Following Methods
Speaker: Prof. Chuangyin Dang, City University of Hong Kong
Abstract
Extensive-form games are a broad class of noncooperative games in game theory and have many applications in economic analysis and decision making. Nash equilibrium in behavioral strategies (NashEBS) was formulated by Nash (1951) for extensive-form games through global rationality, which involves nonconvex optimization. To mitigate this difficulty, the traditional method for finding a NashEBS employs associated normal-form representations, whose size often grows exponentially with the size of the game tree. To meet these challenges, this talk presents a characterization of NashEBS through epsilon-perfect gamma-Nash equilibrium with local sequential rationality. The characterization naturally yields a system of polynomial equations to serve as a necessary and sufficient condition for determining whether a behavioral strategy profile is a NashEBS or not. To eliminate some of counterintuitive NashEBSs, this talk also introduce several refinements of NashEBS and their characterizations, which include subgame perfect equilibrium, sequential equilibrium, extensive-form perfect equilibrium, and extensive-form proper equilibrium. Capitalizing on these characterizations, we constitute barrier and penalty extensive-form games and develop differentiable path-following methods to compute NashEBS and its refinements.
Biography
Prof. Chuangyin Dang received PhD (Cum Laude) in Operations Research and Economics from Tilburg University in 1991, MSc degree in Applied Mathematics from Xidian University in 1986, and BSc degree in Computational Mathematics from Shanxi University in 1983. He is currently Professor in Department of Systems Engineering at City University of Hong Kong. He had served as Head of the department for over 8 years. Prior to this, Prof. Dang held faculty positions at the University of California at Davis, Delft University of Technology, and the University of Auckland, and was a research fellow at the Cowles Foundation for Research in Economics of Yale University. Prof. Dang's research focuses on game theory and applications, systems modeling and optimization, economics and computation, and pattern recognition and machine learning. He is best known for the inventions of the D1-triangulation of the Euclidean space and simplicial path-following methods for integer programming. Due to his significant contributions, Prof. Dang received the awards of outstanding research achievements of the year and outstanding PhD thesis from Tilburg University of The Netherlands in 1990 and 1991, and invited to give talks at universities such as Cornell University, Northwestern University, Stanford University, the University of Michigan at Ann Arbor, and the University of Minnesota at Minneapolis. Prof. Dang has been in the list of Stanford’s top 2% most highly cited scientists since 2020. He has published over 230 papers in journals including Mathematical Programming, INFORMS Journal on Computing, Games and Economic Behavior, Economic Theory, Mathematics of Operations Research, SIAM Journal on Optimization, European Journal of Operational Research, IEEE Transactions on Automatic Control, IEEE Transactions on Pattern Analysis and Machine Intelligence, Artificial Intelligence, and Neural Computation.
Date:
Friday, May 8, 2026 - 16:30


