@InProceedings{giannakopoulos_et_al:LIPIcs.ICALP.2024.72,
author = {Giannakopoulos, Yiannis and Grosz, Alexander and Melissourgos, Themistoklis},
title = {{On the Smoothed Complexity of Combinatorial Local Search}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {72:1--72:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.72},
URN = {urn:nbn:de:0030-drops-202154},
doi = {10.4230/LIPIcs.ICALP.2024.72},
annote = {Keywords: Smoothed Analysis, local search, better-response dynamics, PLS-hardness, combinatorial local optimization, congestion games, pure Nash equilibria}
}