arXiv Analytics

Sign in

arXiv:1710.01787 [math.OC]AbstractReferencesReviewsResources

On Kelly Betting: Some Limitations

Chung-Han Hsieh, B. Ross Barmish

Published 2017-10-04Version 1

The focal point of this paper is the so-called Kelly Criterion, a prescription for optimal resource allocation among a set of gambles which are repeated over time. The criterion calls for maximization of the expected value of the logarithmic growth of wealth. While significant literature exists providing the rationale for such an optimization, this paper concentrates on the limitations of the Kelly-based theory. To this end, we fill a void in published results by providing specific examples quantifying what difficulties are encountered when Taylor-style approximations are used and when wealth drawdowns are considered. For the case of drawdown, we describe some research directions which we feel are promising for improvement of the theory.

Comments: Accepted in 53rd Annual Allerton Conference on Communication, Control, and Computing, 2015
Journal: Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, pp.165-172, 2015
Categories: math.OC, q-fin.PM, q-fin.RM
Related articles: Most relevant | Search more
arXiv:1701.02814 [math.OC] (Published 2017-01-11)
Kelly betting on horse races with uncertainty in probability estimates
arXiv:1906.11227 [math.OC] (Published 2019-06-26)
Nonnegative sum-symmetric matrices, optimal-score partitions, and optimal resource allocation
arXiv:1809.03032 [math.OC] (Published 2018-09-09)
Simulated Annealing for Optimal Resource Allocation in Wireless Networks with ImperfectCommunications