Smoothed Efficient Algorithms and Reductions for Network Coordination Games.

DOI10.4230/LIPIcs.ITCS.2020.73OpenAlexW3003646794MaRDI QIDQ5875780

Shant Boodaghians, Ruta Mehta, Rucha Kulkarni

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1809.02280

zbMATH Keywords

smoothed analysisnetwork coordination games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Beyond the worst case: semi-random complexity analysis of winner determination

This page was built for publication: Smoothed Efficient Algorithms and Reductions for Network Coordination Games.