8 citations · 11 across the 6 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2024
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
Binghui Peng, Aviad Rubinstein
We study the iteration complexity of decentralized learning of approximate correlated equilibria in incomplete information games. On the negative side, we prove that in $\mathit{ex…
cs.GT2023★ 2 cited
Fast swap regret minimization and applications to approximate correlated equilibria
Binghui Peng, Aviad Rubinstein
We give a simple and computationally efficient algorithm that, for any constant , obtains -swap regret within only rounds; t…