IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2603.13581.html

Single-Event Multinomial Full Kelly via Implicit State Positions

Author

Listed:
  • Christopher D. Long

Abstract

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.

Suggested Citation

  • Christopher D. Long, 2026. "Single-Event Multinomial Full Kelly via Implicit State Positions," Papers 2603.13581, arXiv.org.
  • Handle: RePEc:arx:papers:2603.13581
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2603.13581
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2603.13581. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.