基于CP-Nets的偏好聚合近似算法
Approximation Algorithms for Preference Aggregation Using CP-Nets
AI总结:
本文针对CP-nets表示的组合域交换场景偏好聚合问题,分析了平凡2-近似算法的近似比提升条件,提出效果更优的多项式时间近似算法,为得到近似比显著优于2的该类问题算法提供了可能。
摘要:
本文研究组合域上偏好聚合的近似算法设计与分析,偏好采用条件偏好网络(Conditional Preference Networks,CP-nets)表示。研究聚焦于所谓“交换(swaps)”场景下的偏好聚合,已知该场景下的最优解通常规模呈指数级。我们首先分析了一种平凡的2-近似算法,该算法仅输出给定输入偏好中的最优者,并建立了一个结构条件,在此条件下该算法的近似比可提升至$4/3$。随后我们提出一种多项式时间近似算法,其输出可证明不会差于平凡算法,且通常效果显著更优。本文还给出了一类问题实例,在这类实例中我们的改进算法能生成最优解,而对于任意$\boldsymbol{\u03b5}$,平凡算法都无法达到$(2-\u03b5)$-近似比。这些结果有望催生首个多项式时间近似算法,用于求解交换场景下的CP-net聚合问题,且近似比显著优于2。
英文摘要:
This paper studies the design and analysis of approximation algorithms for aggregating preferences over combinatorial domains, represented using Conditional Preference Networks (CP-nets). Its focus is on aggregating preferences over so-called \emph{swaps}, for which optimal solutions in general are already known to be of exponential size. We first analyze a trivial 2-approximation algorithm that simply outputs the best of the given input preferences, and establish a structural condition under which the approximation ratio of this algorithm is improved to $4/3$. We then propose a polynomial-time approximation algorithm whose outputs are provably no worse than those of the trivial algorithm, but often substantially better. A family of problem instances is presented for which our improved algorithm produces optimal solutions, while, for any $\varepsilon$, the trivial algorithm can\emph{not}\/ attain a $(2-\varepsilon)$-approximation. These results may lead to the first polynomial-time approximation algorithm that solves the CP-net aggregation problem for swaps with an approximation ratio substantially better than $2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。