Gambling and Rényi Divergence

01/18/2019
by   Cédric Bleuler, et al.
0

For gambling on horses, a one-parameter family of utility functions is proposed, which contains Kelly's logarithmic criterion and the expected-return criterion as special cases. The strategies that maximize the utility function are derived, and the connection to the Rényi divergence is shown. Optimal strategies are also derived when the gambler has some side information; this setting leads to a novel conditional Rényi divergence.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2020

Maximizing the Bregman divergence from a Bregman family

The problem to maximize the information divergence from an exponential f...
research
06/17/2019

Logarithmic divergences: geometry and interpretation of curvature

We study the logarithmic L^(α)-divergence which extrapolates the Bregman...
research
10/30/2018

Divergence Network: Graphical calculation method of divergence functions

In this paper, we introduce directed networks called `divergence network...
research
06/22/2021

On Selection Criteria for the Tuning Parameter in Robust Divergence

While robust divergence such as density power divergence and γ-divergenc...
research
05/12/2021

Characterizing Logarithmic Bregman Functions

Minimum divergence procedures based on the density power divergence and ...
research
07/04/2012

Structured Region Graphs: Morphing EP into GBP

GBP and EP are two successful algorithms for approximate probabilistic i...
research
09/26/2019

The f-Divergence Expectation Iteration Scheme

This paper introduces the f-EI(ϕ) algorithm, a novel iterative algorithm...

Please sign up or login with your details

Forgot password? Click here to reset