极大极小赞成投票的逼近与参数化复杂性
Approximation and Parameterized Complexity of Minimax Approval Voting
摘要:
我们提出了三个结果的复杂性极小极大批准投票。首先,我们研究了由汉明距离$d$参数化的Minimax赞成投票。我们证明极小极大批准投票不允许算法在时间$\mathcal{O}^\star(2^{o(d\log d)})$上运行,除非指数时间假设(ETH)失败。这意味着Misra等人[AAMAS 2015]的$\mathcal{O}^\star(d^{2d})$算法基本上是最优的。受此启发,我们展示了一个参数化的近似方案,在时间上运行$\mathcal{O}^\star(\left({3}/ε\right)^{2d})$,假设ETH,它本质上是紧的。最后,我们得到了一个新的多项式时间随机近似方案的Minimax批准投票,它运行在时间$n^{\mathcal{O}(1/ε^2 \cdot \log(1/ε))} \cdot \mathrm{poly}(m)$,几乎匹配的运行时间最快的已知PTAS最近字符串由于马和太阳[SIAM J. Comp. 2009]。
英文摘要:
We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance $d$ from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time $\mathcal{O}^\star(2^{o(d\log d)})$, unless the Exponential Time Hypothesis (ETH) fails. This means that the $\mathcal{O}^\star(d^{2d})$ algorithm of Misra et al. [AAMAS 2015] is essentially optimal. Motivated by this, we then show a parameterized approximation scheme, running in time $\mathcal{O}^\star(\left({3}/ε\right)^{2d})$, which is essentially tight assuming ETH. Finally, we get a new polynomial-time randomized approximation scheme for Minimax Approval Voting, which runs in time $n^{\mathcal{O}(1/ε^2 \cdot \log(1/ε))} \cdot \mathrm{poly}(m)$, almost matching the running time of the fastest known PTAS for Closest String due to Ma and Sun [SIAM J. Comp. 2009].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。