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

经典Kelly投注公式在时间相关情况下的推广

A Generalization of the Classical Kelly Betting Formula to the Case of Temporal Correlation

Joseph D. O'Brien, Kevin Burke, Mark E. Burke, B. Ross Barmish

摘要:

对于顺序投注游戏,凯利的理论,旨在最大化一个人的账户价值的对数增长,涉及所谓的投注分数$K$的优化。在这封信中,我们扩展了经典的公式,以允许投注之间的时间相关性。为了证明这种新范式的潜力,为了简单的说明,我们主要解决的情况下,硬币翻转游戏,甚至金钱的回报。为此,我们解决了内存深度$m$的问题。我们的意思是,抛硬币的结果不再被假设为独立同分布。随机变量相反,翻转$k$时正面朝上的概率取决于之前的翻转$k-1,k-2,...,k-m$。对于$n$翻转的最简单情况,使用$m = 1$,我们获得了最佳投注分数的封闭形式解$K_n$。这推广了无记忆情形的经典结果。也就是说,我们的新分数$K_n$依赖于$n$和与时间相关性相关联的参数,而不是充斥于具有正面$p\geq 1/2$概率的硬币的文献的分数$K^* = 2p-1$。概括这些结果$m > 1$和数值模拟也包括在内。最后,我们指出如何理论扩展到随时间变化的反馈和替代支付分布。

英文摘要:

For sequential betting games, Kelly's theory, aimed at maximization of the logarithmic growth of one's account value, involves optimization of the so-called betting fraction $K$. In this Letter, we extend the classical formulation to allow for temporal correlation among bets. To demonstrate the potential of this new paradigm, for simplicity of exposition, we mainly address the case of a coin-flipping game with even-money payoff. To this end, we solve a problem with memory depth $m$. By this, we mean that the outcomes of coin flips are no longer assumed to be i.i.d.random variables. Instead, the probability of heads on flip $k$ depends on previous flips $k-1,k-2,...,k-m$. For the simplest case of $n$ flips, with $m = 1$, we obtain a closed form solution $K_n$ for the optimal betting fraction. This generalizes the classical result for the memoryless case. That is, instead of fraction $K^* = 2p-1$ which pervades the literature for a coin with probability of heads $p\geq 1/2$, our new fraction $K_n$ depends on both $n$ and the parameters associated with the temporal correlation. Generalizations of these results for $m > 1$ and numerical simulations are also included. Finally, we indicate how the theory extends to time-varying feedback and alternative payoff distributions.

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

↑