#hardness-of-approximation

In a unique game, variables take labels from a set of size $k$, and each constraint on a pair of variables $(u,v)$ says that the label of $v$ is a fixed permutation of the label of $u$. Prove or refute that for every $\epsilon >0$ there is a $k$ such that it is NP-hard to distinguish instances…