arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.08522math.OC
收藏

使用有序加权平均的鲁棒最小-最大(遗憾)优化

Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging

Werner Baak, Marc Goerigk, Adam Kasperski, Paweł Zieliński

AI总结:

本文提出一种推广经典 OWA 的新型有序加权平均优化框架,涵盖鲁棒最小-最大与最小-最大遗憾优化,并给出复杂性、不可近似性及改进的近似界,辅以计算实验验证。

摘要:

在不确定性下的决策中,已有若干准则被研究,用于聚合一个解决方案在多种可能情景下的性能。本文针对优化问题引入了一种有序加权平均(OWA)的新型变体。它推广了经典 OWA 方法,后者将鲁棒最小-最大优化以及最小-最大遗憾优化作为特例包含在内。我们针对该设定推导了新的复杂性结果,包括对该问题不可近似性和可近似性的洞见。特别是,我们给出了更强的正面近似结果,这些结果在渐近意义上改进了经典 OWA 方法此前最知名的界。在计算实验中,我们评估了所提方法的质量,并将所提设定与经典 OWA 和最小-最大遗憾方法进行了比较。

英文摘要:

In decision-making under uncertainty, several criteria have been studied to aggregate the performance of a solution over multiple possible scenarios. This paper introduces a novel variant of ordered weighted averaging (OWA) for optimization problems. It generalizes the classic OWA approach, which includes robust min-max optimization as a special case, as well as min-max regret optimization. We derive new complexity results for this setting, including insights into the inapproximability and approximability of this problem. In particular, we provide stronger positive approximation results that asymptotically improve the previously best-known bounds for the classic OWA approach. In computational experiments, we evaluate the quality of the proposed methods and compare the proposed setting with classic OWA and min-max regret approaches.

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

↑