Related papers: Distributional Robust Kelly Gambling: Optimal Stra…
We consider games of chance played by someone with external capital that cannot be applied to the game and determine how this affects risk-adjusted optimal betting. Specifically, we focus on Kelly optimization as a metric, optimizing the…
In this paper, we consider a simple discrete-time optimal betting problem using the celebrated Kelly criterion, which calls for maximization of the expected logarithmic growth of wealth. While the classical Kelly betting problem can be…
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…
We consider the classic Kelly gambling problem with general distribution of outcomes, and an additional risk constraint that limits the probability of a drawdown of wealth to a given undesirable level. We develop a bound on the drawdown…
While the Kelly portfolio has many desirable properties, including optimal long-term growth rate, the resulting investment strategy is rather aggressive. In this paper, we suggest a unified approach to the risk assessment of the Kelly…
For a sequence of binary bets, the Kelly criterion provides a closed-form solution that maximizes the expected growth rate of wealth. In contrast, when multiple bets are placed simultaneously (e.g., in portfolio allocation or prediction…
The takeoff point for this paper is the voluminous body of literature addressing recursive betting games with expected logarithmic growth of wealth being the performance criterion. Whereas almost all existing papers involve use of linear…
Kelly betting is a prescription for optimal resource allocation among a set of gambles which are typically repeated in an independent and identically distributed manner. In this setting, there is a large body of literature which includes…
We study the problem of optimizing the betting frequency in a dynamic game setting using Kelly's celebrated expected logarithmic growth criterion as the performance metric. The game is defined by a sequence of bets with independent and…
Following a series of works on capital growth investment, we analyse log-optimal portfolios where the return evaluation includes `weights' of different outcomes. The results are twofold: (A) under certain conditions, the logarithmic growth…
Kelly's Criterion is well known among gamblers and investors as a method for maximizing the returns one would expect to observe over long periods of betting or investing. These ideas are conspicuously absent from portfolio optimization…
We introduce a robust variant of the Kelly portfolio optimization model, called the Wasserstein-Kelly portfolio optimization. Our model, taking a Wasserstein distributionally robust optimization (DRO) formulation, addresses the fundamental…
Consider a gambling game in which we are allowed to repeatedly bet a portion of our bankroll at favorable odds. We investigate the question of how to minimize the expected number of rounds needed to increase our bankroll to a given target…
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…
Kelly criterion, that maximizes the expectation value of the logarithm of wealth for bookmaker bets, gives an advantage over different class of strategies. We use projective symmetries for a explanation of this fact. Kelly's approach allows…
We investigate the problem of gambling with uncertainty in outcome probabilities. Stochastic optimization models are proposed for optimal investing on events with mutually exclusive outcomes when probabilities are estimated using…
The Stackelberg game model, where a leader commits to a strategy and the follower best responds, has found widespread application, particularly to security problems. In the security setting, the goal is for the leader to compute an optimal…
This paper addresses a novel \emph{cost-sensitive} distributionally robust log-optimal portfolio problem, where the investor faces \emph{ambiguous} return distributions, and a general convex transaction cost model is incorporated. The…
In this paper, motivated by the celebrated work of Kelly, we consider the problem of portfolio weight selection to maximize expected logarithmic growth. Going beyond existing literature, our focal point here is the rebalancing frequency…
We propose a distributionally robust formulation of the traditional risk parity portfolio optimization problem. Distributional robustness is introduced by targeting the discrete probabilities attached to each observation used during…