Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Let's be Honest: An Optimal No-Regret Framework for Zero-Sum Games   We revisit the problem of solving two-player zero-sum games in the
decentralized setting. We propose a simple algorithmic framework that
simultaneously achieves the best rates for honest regret as well as adversarial
regret, and in addition resolves the open problem of removing the logarithmic
terms in convergence to the value of the game. We achieve this goal in three
steps. First, we provide a novel analysis of the optimistic mirror descent
(OMD), showing that it can be modified to guarantee fast convergence for both
honest regret and value of the game, when the players are playing
collaboratively. Second, we propose a new algorithm, dubbed as robust
optimistic mirror descent (ROMD), which attains optimal adversarial regret
without knowing the time horizon beforehand. Finally, we propose a simple
signaling scheme, which enables us to bridge OMD and ROMD to achieve the best
of both worlds. Numerical examples are presented to support our theoretical
claims and show that our non-adaptive ROMD algorithm can be competitive to OMD
with adaptive step-size selection.

12
The categories of this paper are: nucl-th
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
13
The categories of this paper are: quant-ph
16
The categories of this paper are: stat