Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
We construct a graph with $ n $ vertices where the smoothed runtime of the 3-FLIP algorithm
for the 3-Opt Local Max-Cut problem can be as large as $2^{\Omega (\sqrt {n})} $. This …
for the 3-Opt Local Max-Cut problem can be as large as $2^{\Omega (\sqrt {n})} $. This …
A smoothed FPTAS for equilibria in congestion games
Y Giannakopoulos - Proceedings of the 25th ACM Conference on …, 2024 - dl.acm.org
We present a fully polynomial-time approximation scheme (FPTAS) for computing equilibria
in congestion games, under smoothed running-time analysis. More precisely, we prove that …
in congestion games, under smoothed running-time analysis. More precisely, we prove that …
Convergence of for Gradient-Based Algorithms in Zero-Sum Games without the Condition Number: A Smoothed Analysis
I Anagnostides, T Sandholm - arXiv preprint arXiv:2410.21636, 2024 - arxiv.org
Gradient-based algorithms have shown great promise in solving large (two-player) zero-sum
games. However, their success has been mostly confined to the low-precision regime since …
games. However, their success has been mostly confined to the low-precision regime since …