Yansong Li
Papers
1
Total Citations
2
H-Index
1
About
Yansong Li is a rising researcher in algorithmic game theory and optimization, with a focus on solving complex interactive decision-making problems. Their key research areas include Stackelberg games, convex optimization, and multi-agent systems. Li’s major contribution lies in developing algorithms for Stackelberg games that eliminate the need to explicitly model the follower’s cost function—a critical advancement for real-world applications in energy systems, transportation, cybersecurity, and human-robot interaction, where follower behavior is often unknown or hard to characterize. Their 2023 paper, “Solving Strongly Convex and Smooth Stackelberg Games Without Modeling the Follower,” has garnered 2 citations, reflecting its foundational role in this emerging approach. This work addresses a long-standing limitation in game-theoretic models, enabling more practical and scalable solutions. Li’s research bridges theory and application, offering efficient methods for strongly convex and smooth settings. As a scholar, Li is recognized for tackling challenging assumptions in game theory, paving the way for robust decision-making in dynamic environments. Their contributions are particularly valuable for students and researchers seeking to understand how to design algorithms that operate under uncertainty, making Li a notable figure in the field.
Research Focus
Key Achievements
Top Papers
- 1