Inapproximability of Unique Games in Fixed-Point Logic with Counting

04/09/2021
by   Jamie Tucker-Foltz, et al.
0

We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). We prove two new FPC-inexpressibility results for Unique Games: the existence of a (1/2, 1/3 + delta)-inapproximability gap, and inapproximability to within any constant factor. Previous recent work has established similar FPC-inapproximability results for a small handful of other problems. Our construction builds upon some of these ideas, but contains a novel technique. While most FPC-inexpressibility results are based on variants of the CFI-construction, ours is significantly different.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2020

Approximating Constraint Satisfaction Problems Symmetrically

This thesis investigates the extent to which the optimal value of a cons...
research
07/22/2019

Reasoning about Social Choice and Games in Monadic Fixed-Point Logic

Whether it be in normal form games, or in fair allocations, or in voter ...
research
07/12/2021

Separating LREC from LFP

LREC= is an extension of first-order logic with a logarithmic recursion ...
research
02/21/2020

Temporal Constraint Satisfaction Problems in Fixed-Point Logic

Finite-domain constraint satisfaction problems are either solvable by Da...
research
03/15/2021

Strong Parallel Repetition for Unique Games on Small Set Expanders

Strong Parallel Repetition for Unique Games on Small Set Expanders The...
research
10/14/2022

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

At the core of the quest for a logic for PTime is a mismatch between alg...
research
07/14/2022

On Pitts' Relational Properties of Domains

Andrew Pitts' framework of relational properties of domains is a powerfu...

Please sign up or login with your details

Forgot password? Click here to reset