4 citations · 5 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
Playing Coopetitive Polymatrix Games with Small Manipulation Cost
Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh +1
Iterated coopetitive games capture the situation when one must efficiently balance between cooperation and competition with the other agents over time in order to win the game (e.g…
Exploiting No-Regret Algorithms in System Design
Le Cong Dinh, Nick Bishop, Long Tran-Thanh
We investigate a repeated two-player zero-sum game setting where the column player is also a designer of the system, and has full control on the design of the payoff matrix. In add…