不确定组合优化的随机极小极大后悔算法
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
摘要:
不确定条件下组合优化的极大极小后悔问题可以看作是优化方与对手之间的零和博弈,优化方选择一个解,对手选择代价,目的是最大化参与方的后悔.现有的极小极大后悔模型只考虑确定性的解决方案/策略,并且大多数多项式可解问题的极小极大后悔版本是NP-难的。在本文中,我们考虑一个随机模型,其中优化玩家选择的概率分布(对应于一个混合策略)的解决方案和对手选择的成本与知识的球员的分布,但不是它的实现。我们表明,在这个随机模型下,极小极大遗憾版本的任何多项式可解的组合问题成为多项式可解的。这适用于不确定性的区间和离散情景表示。使用随机模型,我们现有的近似算法的确定性模型的基础上的原始-对偶方法的新的证明。最后,我们证明了一般凸不确定性下的极小极大后悔问题是NP-困难的。
英文摘要:
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. The existing minmax regret model considers only deterministic solutions/strategies, and minmax regret versions of most polynomial solvable problems are NP-hard. In this paper, we consider a randomized model where the optimizing player selects a probability distribution (corresponding to a mixed strategy) over solutions and the adversary selects costs with knowledge of the player's distribution, but not its realization. We show that under this randomized model, the minmax regret version of any polynomial solvable combinatorial problem becomes polynomial solvable. This holds true for both the interval and discrete scenario representations of uncertainty. Using the randomized model, we show new proofs of existing approximation algorithms for the deterministic model based on primal-dual approaches. Finally, we prove that minmax regret problems are NP-hard under general convex uncertainty.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。