26 citations · 50 across the 19 of their papers we have counts for
5 papers · 1 filter
Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
Emanuel Tewolde, Brian Hu Zhang, Caspar Oesterheld +4
We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. An example is the absentminded driver game, as well a…
A Lower Bound on Swap Regret in Extensive-Form Games
Constantinos Daskalakis, Gabriele Farina, Noah Golowich +2
Recent simultaneous works by Peng and Rubinstein [2024] and Dagan et al. [2024] have demonstrated the existence of a no-swap-regret learning algorithm that can reach average sw…
Exponential Lower Bounds on the Double Oracle Algorithm in Zero-Sum Games
Brian Hu Zhang, Tuomas Sandholm
The double oracle algorithm is a popular method of solving games, because it is able to reduce computing equilibria to computing a series of best responses. However, its theoretica…
On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria
Brian Hu Zhang, Tuomas Sandholm
We investigate two notions of correlated equilibrium for extensive-form games: extensive-form correlated equilibrium (EFCE) and behavioral correlated equilibrium (BCE). We show tha…
Efficient -Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
Brian Hu Zhang, Ioannis Anagnostides, Gabriele Farina +1
Recent breakthrough results by Dagan, Daskalakis, Fishelson and Golowich [2023] and Peng and Rubinstein [2023] established an efficient algorithm attaining at most swap regret…