单事件多项式全凯利策略 via 隐含状态位置
Single-Event Multinomial Full Kelly via Implicit State Positions
AI总结:
本文提出通过隐含状态位置简化单事件多结果全凯利问题,推导出简洁的凯利公式和贪心算法,提供更直观的记忆方式。
摘要:
对于单事件中有限多个互斥结果,全凯利问题是在非负赌注和可选现金位置下最大化预期对数财富。经典解法中,支持选择步骤常通过拉格朗日乘数处理。本文提供更简短的状态价格推导。现金比例c在每个结果中作为隐含位置:在终端财富意义上,等同于基线赌注cq_i在结果i上。因此,显式投注仅补充有利结果从基线cq_i到最优总赌注p_i。这得出公式x_i = (p_i - c q_i)_+,阈值规则p_i/q_i > c,并在按p_i/q_i排序后,通过一次遍历贪心算法选择支持。结果在本质上是标准的,但隐含位置观点提供简洁证明和方便记忆的方式。
英文摘要:
For a single event with finitely many mutually exclusive outcomes, the full Kelly problem is to maximize expected log wealth over nonnegative stakes together with an optional cash position. The optimal formula is classical, but the support-selection step is often presented via Lagrange multipliers. This note gives a shorter state-price derivation. A cash fraction $c$ acts as an implicit position in every outcome: in terminal-wealth terms, it is equivalent to a baseline stake $cq_i$ on outcome $i$, where $q_i$ is the state price. On any active support, explicit bets therefore only top up favorable outcomes from this baseline $cq_i$ to the optimal total stake $p_i$. This yields the formula $x_i = (p_i - c q_i)_+$, the threshold rule $p_i/q_i > c$, and, after sorting outcomes by $p_i/q_i$, a one-pass greedy algorithm for support selection. The result is standard in substance, but the implicit-position viewpoint gives a compact proof and a convenient way to remember the solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。