19 citations · 19 across the 4 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2025
Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
Hang Ren, Yulin Wu, Shuhan Qi +4
Regret minimization is a powerful method for finding Nash equilibria in Normal-Form Games (NFGs) and Extensive-Form Games (EFGs), but it typically guarantees convergence only for t…
cs.GT2025
Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium
Hang Ren, Xiaozhen Sun, Tianzi Ma +2
The Nash Equilibrium (NE) assumes rational play in imperfect-information Extensive-Form Games (EFGs) but fails to ensure optimal strategies for off-equilibrium branches of the game…
cs.GT2021
Combining Counterfactual Regret Minimization with Information Gain to Solve Extensive Games with Unknown Environments
Chen Qiu, Xuan Wang, Tianzi Ma +2
Counterfactual regret minimization (CFR) is an effective algorithm for solving extensive games with imperfect information (IIEGs). However, CFR is only allowed to be applied in kno…