Generalizing the Kelly strategy
Arjun Viswanathan

TL;DR
This paper extends the Kelly strategy to a broader class of utility functions and considers extraneous wealth, providing a practical method for optimal decision-making in investment scenarios.
Contribution
It generalizes the Kelly strategy to continuous, concave, differentiable utility functions and introduces a quadratic-time calculation method.
Findings
Optimal choice depends only on the probability of reaching a point.
The method simplifies calculations from exponential to quadratic complexity.
Applications include improved automatic investing and risk management.
Abstract
Prompted by a recent experiment by Victor Haghani and Richard Dewey, this note generalises the Kelly strategy (optimal for simple investment games with log utility) to a large class of practical utility functions and including the effect of extraneous wealth. A counterintuitive result is proved : for any continuous, concave, differentiable utility function, the optimal choice at every point depends only on the probability of reaching that point. The practical calculation of the optimal action at every stage is made possible through use of the binomial expansion, reducing the problem size from exponential to quadratic. Applications include (better) automatic investing and risk taking under uncertainty.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Advanced Multi-Objective Optimization Algorithms
