### Voting algorithms for unique games on complete graphs [article]

Antoine Méot and Arnaud de Mesmay and Moritz Mühlenthaler and Alantha Newman
<span title="2021-10-22">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
An approximation algorithm for a Constraint Satisfaction Problem is called robust if it outputs an assignment satisfying a (1 - f(ϵ))-fraction of the constraints on any (1-ϵ)-satisfiable instance, where the loss function f is such that f(ϵ) → 0 as ϵ→ 0. Moreover, the runtime of the algorithm should not depend in any way on ϵ. In this paper, we present such an algorithm for Min-Unique-Games(q) on complete graphs with q labels. Specifically, the loss function is f(ϵ) = (ϵ + c_ϵϵ^2), where c_ϵ is
more &raquo; ... constant depending on ϵ such that lim_ϵ→ 0 c_ϵ = 16. The runtime of our algorithm is O(qn^3) (with no dependence on ϵ) and can run in time O(qn^2) using a randomized implementation with a slightly larger constant c_ϵ. Our algorithm is combinatorial and uses voting to find an assignment. We prove NP-hardness (using a randomized reduction) for Min-Unique-Games(q) on complete graphs even in the case where the constraints form a cyclic permutation, which is also known as Min-Linear-Equations-mod-q on complete graphs.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.11851v1">arXiv:2110.11851v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xfppdrj5tff23ipvezlljtzfd4">fatcat:xfppdrj5tff23ipvezlljtzfd4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211108094622/https://arxiv.org/pdf/2110.11851v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/f0/5cf038d52fc623299d2637491bb5f81f6b55c024.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2110.11851v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>