A resource theory of gambling
- URL: http://arxiv.org/abs/2510.08418v1
- Date: Thu, 09 Oct 2025 16:37:27 GMT
- Title: A resource theory of gambling
- Authors: Maite Arcos, Renato Renner, Jonathan Oppenheim,
- Abstract summary: We recast the Kelly criterion for betting as a resource theory of adversarial information.<n>We compute the optimal strategy which maximises the probability of successfully reaching the target.<n>We generalize this framework to a distributed side-information game.
- Score: 0.509780930114934
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Betting games provide a natural setting to capture how information yields strategic advantage. The Kelly criterion for betting, long a cornerstone of portfolio theory and information theory, admits an interpretation in the limit of infinitely many repeated bets. We extend Kelly's seminal result into the single-shot and finite-betting regimes, recasting it as a resource theory of adversarial information. This allows one to quantify what it means for the gambler to have more information than the odds-maker. Given a target rate of return, after a finite number of bets, we compute the optimal strategy which maximises the probability of successfully reaching the target, revealing a risk-reward trade-off characterised by a hierarchy of R\'enyi divergences between the true distribution and the odds. The optimal strategies in the one-shot regime coincide with strategies maximizing expected utility, and minimising hypothesis testing errors, thereby bridging economic and information-theoretic viewpoints. We then generalize this framework to a distributed side-information game, in which multiple players observe correlated signals about an unknown state. Recasting gambling as an adversarial resource theory provides a unifying lens that connects economic and information-theoretic perspectives, and allows for generalisation to the quantum domain, where quantum side-information and entanglement play analogous roles.
Related papers
- Multivariate Rényi divergences characterise betting games with multiple lotteries [0.9558392439655014]
We show that the multivariate Rényi divergence $D_underline(vecP_X)$ of probability distributions $vecP_X =(p(0)_X,dots,p(d)_X)$ quantifies the economic-theoretic value that a rational agent assigns to lotteries.<n>In particular, when the odds are fair and the rational agent maximises over all betting strategies, the economic-theoretic value that the agent assigns to lotteries is exactly given by $wmathrmICE_underlineR
arXiv Detail & Related papers (2026-01-25T14:15:30Z) - Decoding Rewards in Competitive Games: Inverse Game Theory with Entropy Regularization [52.74762030521324]
We propose a novel algorithm to learn reward functions from observed actions.<n>We provide strong theoretical guarantees for the reliability and sample efficiency of our algorithm.
arXiv Detail & Related papers (2026-01-19T04:12:51Z) - Sequential Manipulation Against Rank Aggregation: Theory and Algorithm [119.57122943187086]
We leverage an online attack on the vulnerable data collection process.
From the game-theoretic perspective, the confrontation scenario is formulated as a distributionally robust game.
The proposed method manipulates the results of rank aggregation methods in a sequential manner.
arXiv Detail & Related papers (2024-07-02T03:31:21Z) - Learning to Mitigate Externalities: the Coase Theorem with Hindsight Rationality [62.18973784316808]
In economic theory, the concept of externality refers to any indirect effect resulting from an interaction between players that affects the social welfare.<n>Our work removes the classical assumption that bargainers possess perfect knowledge of the underlying game.<n>We then design a policy for the players which allows them to learn a bargaining strategy which maximizes the total welfare.
arXiv Detail & Related papers (2024-06-28T11:00:53Z) - Rejection via Learning Density Ratios [50.91522897152437]
Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
arXiv Detail & Related papers (2024-05-29T01:32:17Z) - Fundamental connections between utility theories of wealth and
information theory [0.0]
We establish fundamental connections between utility theories of wealth from the economic sciences and information-theoretic quantities.
We introduce new conditional R'enyi divergences, and explore some of their properties.
arXiv Detail & Related papers (2023-05-22T09:46:08Z) - Towards Multi-Agent Reinforcement Learning driven Over-The-Counter
Market Simulations [16.48389671789281]
We study a game between liquidity provider and liquidity taker agents interacting in an over-the-counter market.
By playing against each other, our deep-reinforcement-learning-driven agents learn emergent behaviors.
We show convergence rates for our multi-agent policy gradient algorithm under a transitivity assumption.
arXiv Detail & Related papers (2022-10-13T17:06:08Z) - The Many Faces of Adversarial Risk [6.85316573653194]
We make adversarial risk mathematically rigorous and examine its similarities and differences.
Our tools derive from optimal transport, robust statistics, functional analysis, and game theory.
arXiv Detail & Related papers (2022-01-22T03:05:09Z) - Bounded rationality for relaxing best response and mutual consistency:
An information-theoretic model of partial self-reference [0.0]
This work focuses on some of the assumptions underlying rationality such as mutual consistency and best-response.
We consider ways to relax these assumptions using concepts from level-$k$ reasoning and quantal response equilibrium (QRE) respectively.
arXiv Detail & Related papers (2021-06-30T06:56:56Z) - Fundamental Limits and Tradeoffs in Invariant Representation Learning [99.2368462915979]
Many machine learning applications involve learning representations that achieve two competing goals.
Minimax game-theoretic formulation represents a fundamental tradeoff between accuracy and invariance.
We provide an information-theoretic analysis of this general and important problem under both classification and regression settings.
arXiv Detail & Related papers (2020-12-19T15:24:04Z) - Learning Strategies in Decentralized Matching Markets under Uncertain
Preferences [91.3755431537592]
We study the problem of decision-making in the setting of a scarcity of shared resources when the preferences of agents are unknown a priori.
Our approach is based on the representation of preferences in a reproducing kernel Hilbert space.
We derive optimal strategies that maximize agents' expected payoffs.
arXiv Detail & Related papers (2020-10-29T03:08:22Z) - Efficient exploration of zero-sum stochastic games [83.28949556413717]
We investigate the increasingly important and common game-solving setting where we do not have an explicit description of the game but only oracle access to it through gameplay.
During a limited-duration learning phase, the algorithm can control the actions of both players in order to try to learn the game and how to play it well.
Our motivation is to quickly learn strategies that have low exploitability in situations where evaluating the payoffs of a queried strategy profile is costly.
arXiv Detail & Related papers (2020-02-24T20:30:38Z) - Kelly Betting with Quantum Payoff: a continuous variable approach [1.3999481573773072]
The payoff of the gambler is encoded into the internal degrees of freedom of a quantum memory element.
We define the doubling rate of the model and identify the optimal gambling strategy for fixed odds and probabilities of winning.
arXiv Detail & Related papers (2020-01-30T15:28:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.