Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2457 · Mar 202619922001200920172026
48 results for betting

Inefficient markets allow investors to consistently outperform the market. To demonstrate that inefficiencies exist in sports betting markets, we created a betting algorithm that generates above market returns for the NFL, NBA, NCAAF, NCAAB, and WNBA betting markets. To formulate our betting strategy, we collected and …

2019-10-19abs ↗pdf ↗

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 arguments that the theory often leads to bets which are "too aggressive" with resp…

2017-10-04abs ↗pdf ↗

Modeling horse race betting odds with Ornstein-Uhlenbeck process.

problem Analyzing how herding and informed bettors affect odds movements.
method Deriving an Ornstein-Uhlenbeck process from vote shares and odds movements data.
result Identified microscopic and macroscopic patterns in odds convergence.

In the UK betting market, bookmakers often offer a free coupon to new customers. These free coupons allow the customer to place extra bets, at lower risk, in combination with the usual betting odds. We are interested in whether a customer can exploit these free coupons in order to make a sure gain, and if so, how the c…

2019-01-07abs ↗pdf ↗

This paper optimizes sports betting strategies using neural networks and portfolio theory.

problem Optimizing betting strategies in sports gambling.
method Combining neural network models with portfolio optimization, integrating Von Neumann-Morgenstern Expected Utility Theory and the Kelly Criterion.
result Achieved 135.8% relative profit during the English Premier League season.

New betting strategy reduces regret to ln(ln n) with protection against adversarial data.

problem Tackles the problem of minimizing regret in betting against adversarial and stochastic data.
method Combines insights from Robbins and Cover, using a mixture strategy.
result Exhibits a regret of O(ln(ln n)) on almost all paths, with O(log n) regret on the complement.

We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate or intensity of bets placed by gamblers. The bookmaker seeks a price process that maximizes his exp…

2019-07-01abs ↗pdf ↗

Testing-by-betting strategies almost surely go bankrupt under null hypotheses.

problem Understanding the behavior of betting strategies under null hypotheses.
method Analyzed the asymptotics of betting strategies under null distributions, focusing on the almost sure divergence of sums.
result Testing-by-betting strategies go bankrupt with probability one under any non-degenerate null distribution.

The betting CI outperforms classical methods in constructing confidence intervals for bounded means.

problem Constructing nonasymptotic confidence intervals for bounded means.
method A betting-based approach to define and time-uniform variants of confidence intervals (CSs).
result The betting CI matches the fundamental limits, outperforming existing empirical Bernstein CIs.

Study proposes new methods to convert betting odds into accurate probabilities for sports forecasting.

problem Convert betting odds to accurate outcome probabilities for sports forecasting and market efficiency analysis.
method Proposes two methods: Odds-Only-Equal-Profitability-Confidence (OO-EPC) and Favourite-Longshot-Bias-Adjusted Generalised Linear Model (FL-GLM).
result Proposed methods outperform existing methods in empirical tests and real-world applications.

Sequential tests for two-sample and independence testing using betting strategies.

problem Testing sequential data for two-sample and independence without kernel selection issues.
method Prediction-based betting strategies that adaptively determine distribution and joint distribution.
result Prediction-based tests outperform kernel-based approaches in high-dimensional or structured data settings.

The study shows how probability weighting can lead to betting in a risk-averse economy.

problem Understanding how probability weighting affects economic behavior and risk aversion.
method Examining a von Neumann-Morgenstern economy with an RDU agent to model probability weighting effects.
result Probability weighting can lead to endogenous betting in an economy with common beliefs.

This work examines the effects of allowing borrowing in betting-based hypothesis testing.

problem The impact of allowing borrowing in betting-based hypothesis testing.
method Examined the consequences of allowing borrowing in each round, adjusting the rejection threshold accordingly.
result There is no extra price to pay for the possibility of borrowing if a path-dependent threshold is used.

Study compares financial and gambling markets, finding similarities and potential applications.

problem Lack of comprehensive study on gambling markets compared to financial markets.
method Comprehensive comparison of five aspects: platform, product, procedure, participant, and strategy.
result Well-established financial strategies can be applied to gambling markets, particularly in peer-to-peer betting exchanges.

A new method combines multiple bounds and betting strategies for selective prediction, improving risk coverage in data-scarce settings.

problem Selective prediction with risk control in data-scarce domains.
method Combines concentration inequalities, multiple-testing corrections, and betting-based confidence sequences.
result Transfer-Informed Betting achieves tighter bounds and better coverage in data-scarce settings.

Scores political leanings in Web3 betting markets.

problem Understanding political motivations in decentralized prediction markets.
method Constructing PBLS from Polymarket data, analyzing 15k addresses, 4k events, 8k markets.
result Validated PBLS through internal and external comparisons, revealing political and profit motives.

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 for an interesting financial interpretation of the Boltzmann/Shannon entropy. A…

2006-07-18abs ↗pdf ↗

We revisit the trading invariance hypothesis recently proposed by Kyle and Obizhaeva by empirically investigating a large dataset of bets, or metaorders, provided by ANcerno. The hypothesis predicts that the quantity $I:=\ri/N^{3/2}$, where $\ri$ is the exchanged risk (volatility ×\times volume ×\times price) and NN

2019-02-09abs ↗pdf ↗

We study the problem of nonparametric dependence detection. Many existing methods may suffer severe power loss due to non-uniform consistency, which we illustrate with a paradox. To avoid such power loss, we approach the nonparametric test of independence through the new framework of binary expansion statistics (BEStat…

2016-10-17abs ↗pdf ↗

The original Kelly criterion provides a strategy to maximize the long-term growth of winnings in a sequence of simple Bernoulli bets with an edge, that is, when the expected return on each bet is positive. The objective of this work is to consider more general models of returns and the continuous time, or high frequenc…

2020-02-09abs ↗pdf ↗

Optimal strategies are found for a repeated betting game using diffusion approximation.

problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.

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 identically distributed returns X(k). The bettor selects the fraction of wealth K wa…

2018-01-20abs ↗pdf ↗

The main purpose of this study is to introduce a semi-classical model describing betting scenarios in which, at variance with conventional approaches, the payoff of the gambler is encoded into the internal degrees of freedom of a quantum memory element. In our scheme, we assume that the invested capital is explicitly a…

2020-01-30abs ↗pdf ↗

A risk-neutral valuation framework is developed for pricing and hedging in-play football bets based on modelling scores by independent Poisson processes with constant intensities. The Fundamental Theorems of Asset Pricing are applied to this set-up which enables us to derive novel arbitrage-free valuation formulæ for c…

2018-10-29abs ↗pdf ↗

Study analyzes gambling behavior and risk attitudes using blockchain data.

problem Lack of real-life gambling data for validating predictions and experimental findings.
method Collects and analyzes betting data from a decentralized application on the Ethereum Blockchain.
result Empirical examples of gambling systems and insights into risk preferences.

Study improves forecasting in betting markets using novel neural networks.

problem Improving short-term price movement predictions in betting exchanges.
method Innovative convolutional attention mechanisms applied to recurrent neural networks and bi-dimensional layers.
result All proposed innovations positively impact classification task performance.

Paper shows how online betting algorithms' regret can be used to create tight confidence sequences.

problem Estimating the expectation of random variables from samples and creating time-uniform confidence sequences.
method Converts the regret guarantee of universal portfolio algorithms into time-uniform concentration inequalities and confidence sequences.
result Numerically obtained confidence sequences are never vacuous and satisfy the law of iterated logarithm.