arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2205.13499math.PR
收藏

利用 Catalan 三角形求解几乎所有 n 下 Chow-Robbins 博弈的精确解

Exact Solution to the Chow-Robbins Game for almost all n, using the Catalan Triangle

John H. Elton

AI总结:

本文借助 Catalan 三角形矩、广义逆向归纳及 Brownian 界,给出 Chow-Robbins 博弈最优停止阈值 k_n 对几乎所有 n 的精确闭式。

摘要:

Chow-Robbins 抛硬币博弈的收益是你停止时正面朝上的比例。Chow 和 Robbins(1965)研究了何时停止以最大化期望的问题,他们证明存在整数 {k_n},使得当正面数减去反面数达到该值时停止是最优的。除了通过计算机求得的有限多个情形外,精确求出 {k_n} 一直未获解决。我们证明对几乎所有 n,都有 ${k_n} = \left\lceil {α\sqrt n \\,\\, - 1/2\\,\\, + \\,\\,\frac{{\left( { - 2ζ( - 1/2)} \right)\sqrt α}}{\sqrt π}{n^{ - 1/4}}} \right\rceil$,其中 $α$ 是 Shepp-Walker 常数。这源于我们对 Dvoretzky(1967)针对更一般的 Value 函数所定义实数的估计:${β_n} = α\sqrt n \\,\\, - 1/2\\,\\, + \\,\\,\frac{{\left( { - 2ζ( - 1/2)} \right)\sqrt α}}{\sqrt π}{n^{ - 1/4}} + O\left( {n^{ - 7/24}} \right)$;该 Value 函数在其第一个参数上连续,因而更易于分析。Christensen 和 Fischer(2022)根据数值证据猜想存在 $O({n^{ - 1/4}})$ 阶的依赖项。我们的证明使用了涉及 Catalan 数和 Catalan 三角形数的矩,这些数出现在由逆向归纳产生的树中;同时还使用了广义逆向归纳原理。其动机来自 Häggström 和 Wästlund(2013)的一个想法:从某个视界出发,对 Value 的上界和下界进行逆向归纳;他们将其用于数值计算,解决了少数情形。Christensen 和 Fischer 借助好得多的界解决了更多情形。我们使用 Skorohod 嵌入,从 Brownian 类比中获得简单的上界和下界;其中上界正是 Christensen 和 Fischer 以另一种方式发现的界。我们首先将这些界用于更多例子,但新的核心思想是在树中以代数方式使用它们,并通过反馈在边界附近获得更锐利的 Value 估计,从而解决几乎所有 n。

英文摘要:

The payoff in the Chow-Robbins coin-tossing game is the proportion of heads when you stop. Knowing when to stop to maximize expectation was addressed by Chow and Robbins(1965), who proved there exist integers ${k_n}$ such that it is optimal to stop when heads minus tails reaches this. Finding ${k_n}$ exactly was unsolved except for finitely many cases by computer. We show ${k_n} = \left\lceil {α\sqrt n \,\, - 1/2\,\, + \,\,\frac{{\left( { - 2ζ( - 1/2)} \right)\sqrt α}}{\sqrt π}{n^{ - 1/4}}} \right\rceil$ for almost all n, where $α$ is the Shepp-Walker constant.This comes from our estimate ${β_n} = α\sqrt n \,\, - 1/2\,\, + \,\,\frac{{\left( { - 2ζ( - 1/2)} \right)\sqrt α}}{\sqrt π}{n^{ - 1/4}} + O\left( {n^{ - 7/24}} \right)$ of real numbers defined by Dvoretzky(1967) for a more general Value function which is continuous in its first argument and easier to analyze. An $O({n^{ - 1/4}})$ dependence was conjectured by Christensen and Fischer(2022) from numerical evidence. Our proof uses moments involving Catalan and Catalan triangle numbers which appear in a tree resulting from backward induction, and a generalized backward induction principle. It was motivated by an idea of Häggström and Wästlund(2013) to use backward induction of upper and lower Value bounds from a horizon, which they used numerically to settle a few cases. Christensen and Fischer, with much better bounds, settled many more cases. We use Skorohod's embedding to get simple upper and lower bounds from the Brownian analog; our upper bound is the one found by Christensen and Fischer in a different way. We use them first for many more examples, but the new idea is to use them algebraically in the tree, with feedback to get a sharper Value estimate near the border, to settle almost all n.

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

↑