For constant-relative-risk-aversion (CRRA) utility functions, the Kelly criterion is optimal iff you have logarithmic utility. For proof, see Samuelson (1971), The "Fallacy" of Maximizing the Geometric Mean in Long Sequences of Investing or Gambling.
I think there is only a fixed-proportion betting rule (i.e. "bet P% of your bankroll" for fixed P) for CRRA utility functions, because if risk aversion varies then the betting rule must also vary. But I'm not sure how to prove that.
ETA: Actually I think it shouldn't be too hard to prove that using the definition of CRRA. You could do something like, assume a fixed-proportion betting rule exists for some constant P, and then calculate the implied relative risk aversion and show that it must be a constant.
The basic rough argument for Kelly betting goes something like this.
First, assume we’re making a sequence of T independent bets, one-after-another, with multiplicative returns (similar to e.g. financial markets). We choose how much money to put on which bets at each timestep.
Returns multiply, so log returns add. And they’re independent at each timestep, so the total log return over T timesteps is a sum of T independent random variables. “Sum of T independent random variables” makes us want to invoke the Central Limit Theorem, so let’s assume whatever other conditions we need in order to do that. (There are multiple options for the other conditions.) So: total log return will be normally distributed for large T, with mean equal to the sum of expected log return at each timestep.
Then the key question is: for any given utility function, will it be dominated by the typical/modal/median return, or will it be dominated by the tails? For instance, the utility function u(W) = W is dominated by the upper tail: agents maximizing that utility function will happily accept a probability-approaching-1 of zero wealth, in exchange for an exponentially tiny chance of exponentially huge returns. On the other end of the spectrum, a utility function which just wants wealth above some relatively-low threshold (i.e. utility = 0 below threshold, utility = 1 above) will be dominated by the lower tail: agents maximizing that utility function mostly care about minimizing the increasingly-tiny probability of a total return below the threshold, and will pass up exponentially larger returns in order to avoid that downside.
But in the middle, it seems like there should be a whole class of utility functions which are dominated by the typical/modal/median return. And what the hand-wavy central limit argument says is that an agent with any of the utility functions in that class will, for sufficiently large T, just maximize expected log return at each timestep - i.e. Kelly bet. That class of utility functions is the “basin of convergence” for Kelly betting - i.e. the class of utility functions whose asymptotic behavior converges to Kelly betting, for long time horizons (i.e. large T) when making a sequence of independent bets with multiplicative returns.
Thus the question of this post: what’s the basin of convergence for Kelly betting?
I don't know the answer to that question, despite having poked at it a little. The rest of this post will contain some more quick-and-dirty thoughts on the topic, but my main hope is that somebody else will be inspired to answer the question.
Suppose that, at each timestep, our agent invests their portfolio into some assets. The proportion invested in each asset at time is , and the return of asset between and is . Then the total wealth after timesteps is
The agent has some utility function , and chooses at each timestep to maximize .
For the easiest version of the problem which still captures the bulk of the intent, let's assume that returns are independent and identically distributed (IID) over time.
Now, if we want to use the Central Limit Theorem, we need to be IID over time, and also have bounded variance. Alas, both of those can definitely be false:
Concrete examples where each of the above conditions fails:
... so a central part of the challenge of proving a basin of convergence for Kelly is showing that, within the basin, problems of this sort do not break the argument (... or using some entirely different kind of argument for Kelly).
The other big part of proving a basin of convergence would presumably be to talk about the expected-utility-contribution from the tails of the distribution.