论文标题
惊喜最大化：一种动态的编程方法
Surprise Maximization: A Dynamic Programming Approach
论文作者
论文摘要
Borwein等。 （2000）通过应用凸分析和数学编程的结果解决了一个惊喜最大化问题。尽管他们的证明是优雅的，但它需要两个领域的先进知识才能理解它。在这里，我们提供了另一种方法，通过利用动态编程来得出问题的最佳解决方案。
Borwein et al. (2000) solved a surprise maximization problem by applying results from convex analysis and mathematical programming. Although, their proof is elegant, it requires advanced knowledge from both areas to understand it. Here, we provide another approach to derive an optimal solution of the problem by utilizing dynamic programming.
