基于覆盖技术的可探索随机不确定性下的集合选择
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques
AI总结:
针对可探索不确定性下的最小总价值集合选择问题,研究者通过线性规划建立其与不确定约束覆盖问题的结构关联,提出算法框架得到竞争比近似紧界,突破了对抗性下界,为该领域更一般问题求解奠基。
摘要:
给定若干不确定值的子集,我们研究通过尽可能少地查询值来找出总价值(不确定值之和)最小的子集的问题。该集合选择问题属于可探索不确定性领域,且在该领域具有核心重要性,因为它能推导出背包问题、匹配问题等一系列有趣组合问题的强对抗性下界。我们考虑了该问题的一个随机变体,并提出了在期望意义下优于这些对抗性下界的算法。我们研究结果的关键在于,通过线性规划公式证明了该问题与一个看似无关、约束条件存在不确定性的覆盖问题之间存在强结构关联。我们利用这一关联推导出一个算法框架,可用于求解这两类不确定性问题,并得到了竞争比的近似紧界。这是首个在集合无额外已知结构的情况下,针对未知值之和的非平凡随机结果。凭借我们提出的新方法,我们为求解可探索不确定性领域中更具一般性的问题奠定了基础。
英文摘要:
Given subsets of uncertain values, we study the problem of identifying the subset of minimum total value (sum of the uncertain values) by querying as few values as possible. This set selection problem falls into the field of explorable uncertainty and is of intrinsic importance therein as it implies strong adversarial lower bounds for a wide range of interesting combinatorial problems such as knapsack and matchings. We consider a stochastic problem variant and give algorithms that, in expectation, improve upon these adversarial lower bounds. The key to our results is to prove a strong structural connection to a seemingly unrelated covering problem with uncertainty in the constraints via a linear programming formulation. We exploit this connection to derive an algorithmic framework that can be used to solve both problems under uncertainty, obtaining nearly tight bounds on the competitive ratio. This is the first non-trivial stochastic result concerning the sum of unknown values without further structure known for the set. With our novel methods, we lay the foundations for solving more general problems in the area of explorable uncertainty.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。