2 papers
cs.GT2023
Regret-Minimizing Double Oracle for Extensive-Form Games
Xiaohang Tang, Le Cong Dinh, Stephen Marcus McAleer +1
By incorporating regret minimization, double oracle methods have demonstrated rapid convergence to Nash Equilibrium (NE) in normal-form games and extensive-form games, through algo…
cs.LG2023
Achieving Better Regret against Strategic Adversaries
Le Cong Dinh, Tri-Dung Nguyen, Alain Zemkoho +1
We study online learning problems in which the learner has extra knowledge about the adversary's behaviour, i.e., in game-theoretic settings where opponents typically follow some n…