On approximate reconfigurability of label cover

Given a two-prover game G and its two satisfying labelings ${\psi }_{\mathrm{ini}}$ and ${\psi }_{\mathrm{tar}}$, the Label Cover Reconfiguration problem asks whether ${\psi }_{\mathrm{ini}}$ can be transformed into ${\psi }_{\mathrm{tar}}$ by repeatedly changing the label of a single vertex while preserving any intermediate labeling satisfying G. We consider its optimization version by relaxing the feasibility of labelings, referred to as Maxmin Label Cover Reconfiguration: We are allowed to pass through any non-satisfying labelings, but required to maximize the “soundness error,” which is defined as the minimum fraction of satisfied edges during transformation from ${\psi }_{\mathrm{ini}}$ to ${\psi }_{\mathrm{tar}}$. Since the parallel repetition theorem of Raz (1998) [32], which implies

-hardness of approximating Label Cover within any constant factor, gives strong inapproximability results for many

-hard problems, one may think of using Maxmin Label Cover Reconfiguration to derive inapproximability results for reconfiguration problems. We prove the following results on Maxmin Label Cover Reconfiguration, which display different trends from those of Label Cover and the parallel repetition theorem:

• •
  Maxmin Label Cover Reconfiguration can be approximated within a factor of $\frac{1}{4}-o\left(1\right)$ for some restricted graph classes, including biregular graphs, balanced bipartite graphs with no isolated vertices, and superconstant average degree graphs.
• •
  A “naive” parallel repetition of Maxmin Label Cover Reconfiguration does not decrease the soundness error for every two-prover game.
• •
  Label Cover Reconfiguration on projection games can be decided in polynomial time.

Our results suggest that a reconfiguration analogue of the parallel repetition theorem is unlikely.