In this paper, we study the class of games known as hidden-role games in...
No-regret learners seek to minimize the difference between the loss they...
We consider the problem of steering no-regret-learning agents to play
de...
We introduce a new approach for computing optimal equilibria via learnin...
Regret Matching+ (RM+) and its variants are important algorithms for sol...
The process of revising (or constructing) a policy immediately prior to
...
Most of the literature on learning in games has focused on the restricti...
No-press Diplomacy is a complex strategy game involving both cooperation...
In the literature on game-theoretic equilibrium finding, focus has mainl...
A recent paper by Piliouras et al. [2021, 2022] introduces an uncoupled
...
In this paper, we establish efficient and uncoupled learning dynamics so...
A recent line of work has established uncoupled learning dynamics such t...
Recent techniques for approximating Nash equilibria in very large games
...
In this paper we establish efficient and uncoupled learning dynamics
so ...
We show that, for any sufficiently small fixed ϵ > 0, when both
players ...
Most existing results about last-iterate convergence of learning
dynamic...
We study the problem of finding optimal correlated equilibria of various...
A recent emerging trend in the literature on learning in games has been
...
In this paper, we introduce a new representation for team-coordinated
ga...
While extensive-form games (EFGs) can be converted into normal-form game...
We consider the task of building strong but human-like policies in
multi...
The practical scalability of many optimization algorithms for large
exte...
Recently, Daskalakis, Fishelson, and Golowich (DFG) (NeurIPS`21) showed ...
While in two-player zero-sum games the Nash equilibrium is a well-establ...
We study the application of iterative first-order methods to the problem...
The existence of simple uncoupled no-regret learning dynamics that conve...
Tree-form sequential decision making (TFSDM) extends classical one-shot
...
Regret minimization has proved to be a versatile tool for tree-form
sequ...
We focus on the problem of finding an optimal strategy for a team of two...
Unlike normal-form games, where correlated equilibria have been studied ...
Blackwell approachability is a framework for reasoning about repeated ga...
The existence of simple, uncoupled no-regret dynamics that converge to
c...
Recently, there has been growing interest around less-restrictive soluti...
Monte-Carlo counterfactual regret minimization (MCCFR) is the
state-of-t...
Self-play methods based on regret minimization have become the state of ...
We study the performance of optimistic regret-minimization algorithms fo...
Coarse correlation models strategic interactions of rational agents
comp...
While Nash equilibrium in extensive-form games is well understood, very
...
The CFR framework has been a powerful tool for solving large-scale
exten...
Equilibrium refinements are important in extensive-form (i.e., tree-form...
Regret minimization is a powerful tool for solving large-scale problems;...
Regret minimization is a powerful tool for solving large-scale problems;...
There has been tremendous recent progress on equilibrium-finding algorit...
Regret minimization is a powerful tool for solving large-scale extensive...
Stackelberg equilibria have become increasingly important as a solution
...
No-regret learning has emerged as a powerful tool for solving extensive-...
A kidney exchange is a centrally-administered barter market where patien...