arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.01586cs.CC
收藏

唯一对策问题的下界

Lower Bound for the Unique Games Problem

Rajeev Kohli, Ramesh Krishnamurti

摘要:

我们考虑了唯一对策问题的一个随机算法,利用独立多项式概率给图的顶点分配标签。通过该算法得到的解的期望值被表示为概率的函数。找到最大化这个预期值的概率是等同于获得一个最佳的解决方案的独特的游戏问题。通过在多项式时间内求解问题的半定规划松弛,得到了最优解的上界。我们使用一个不同但相关的公式来证明这个上限不大于唯一博弈问题最优解的π/2倍。

英文摘要:

We consider a randomized algorithm for the unique games problem, using independent multinomial probabilities to assign labels to the vertices of a graph. The expected value of the solution obtained by the algorithm is expressed as a function of the probabilities. Finding probabilities that maximize this expected value is shown to be equivalent to obtaining an optimal solution to the unique games problem. We attain an upper bound on the optimal solution value by solving a semidefinite programming relaxation of the problem in polynomial time. We use a different but related formulation to show that this upper bound is no greater than π/2 times the value of the optimal solution to the unique games problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑