no code implementations • 21 Feb 2018 • L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
We also present another algorithm for computing a spanning tree with congestion $\mathcal{O}(\sqrt{mn})$; this algorithm runs in sub-exponential time when $m = \omega(n \log^2 n)$.
Data Structures and Algorithms Computational Complexity Discrete Mathematics
no code implementations • NeurIPS 2018 • Yun Kuen Cheung
Since Multiplicative Weights (MW) updates are the discrete analogue of the continuous Replicator Dynamics (RD), some researchers had expected their qualitative behaviours would be similar.
no code implementations • NeurIPS 2020 • Yun Kuen Cheung, Georgios Piliouras
We present volume analyses of Multiplicative Weights Updates (MWU) and Optimistic Multiplicative Weights Updates (OMWU) in zero-sum as well as coordination games.
no code implementations • ICLR 2021 • Yun Kuen Cheung, Yixin Tao
We study how persistent chaos can occur in the more general normal game settings, where the agents might have motivation to coordinate (which is not true for zero-sum games) and the number of agents can be arbitrary.
no code implementations • 9 Jun 2021 • Yun Kuen Cheung, Georgios Piliouras
Passivity is a fundamental concept in control theory, which abstracts energy conservation and dissipation in physical systems.
no code implementations • ICLR 2022 • Yun Kuen Cheung, Georgios Piliouras, Yixin Tao
We study standard online learning in games but from a non-standard perspective.
