English
Related papers

Related papers: How to Gamble Against All Odds

200 papers

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…

Quantum Physics · Physics 2026-01-15 Maite Arcos , Renato Renner , Jonathan Oppenheim

As predictive models are deployed into the real world, they must increasingly contend with strategic behavior. A growing body of work on strategic classification treats this problem as a Stackelberg game: the decision-maker "leads" in the…

Machine Learning · Computer Science 2022-02-01 Tijana Zrnic , Eric Mazumdar , S. Shankar Sastry , Michael I. Jordan

Accurately predicting the outcome of sporting events has been a goal for many groups who seek to maximize profit. What makes this challenging is that the outcome of an event can be influenced by many factors that dynamically change across…

Applications · Statistics 2017-10-23 Erik J. Schlicht

We study variants of a stochastic game inspired by backgammon where players may propose to double the stake, with the game state dictated by a one-dimensional random walk. Our variants allow for different numbers of proposals and different…

Optimization and Control · Mathematics 2024-10-28 Haoru Ju , Daniel Leifer , Steven J. Miller , Sooraj A. Padmanabhan , Chenyang Sun , Luke Tichi , Benjamin Tocher , Kiley Wallace

Consider a gambler who observes a sequence of independent, non-negative random numbers and is allowed to stop the sequence at any time, claiming a reward equal to the most recent observation. The famous prophet inequality of Krengel,…

Data Structures and Algorithms · Computer Science 2012-01-24 Robert Kleinberg , S. Matthew Weinberg

In the prophet inequality problem, a gambler faces a sequence of items arriving online with values drawn independently from known distributions. On seeing an item, the gambler must choose whether to accept its value as her reward and quit…

Data Structures and Algorithms · Computer Science 2023-05-23 Archit Bubna , Ashish Chiplunkar

Financial markets investors are involved in many games -- they must interact with other agents to achieve their goals. Among them are those directly connected with their activity on markets but one cannot neglect other aspects that…

Trading and Market Microstructure · Quantitative Finance 2008-12-02 Edward W. Piotrowski , Jan Sladkowski , Anna Szczypinska

This paper is concerned with asymptotic behaviour of a repeated game of "odds and evens", with strategies of both players represented by finite automata. It is proved that, for every $n$, there is an automaton with $2^n \cdot…

Computer Science and Game Theory · Computer Science 2020-06-30 Vladislav Makarov

We introduce a way to compare actions in decision problems. One action is safer than another if the set of beliefs at which the decision-maker prefers the safer action expands as the decision-maker becomes more risk averse. We provide a…

Theoretical Economics · Economics 2026-02-19 Marilyn Pease , Mark Whitmeyer

It is known that a player in a noncooperative game can benefit by publicly restricting his possible moves before play begins. We show that, more generally, a player may benefit by publicly committing to pay an external party an amount that…

General Economics · Economics 2024-01-05 James W. Bono , David H. Wolpert

Gameplay under various forms of uncertainty has been widely studied. Feldman et al. (2010) studied a particularly low-information setting in which one observes the opponent's actions but no payoffs, not even one's own, and introduced an…

Computer Science and Game Theory · Computer Science 2024-04-02 Avrim Blum , Melissa Dutz

We consider a game with two players, consisting of a number of rounds, where the first player to win $n$ rounds becomes the overall winner. Who wins each individual round is governed by a certain urn having two types of balls (type 1 and…

Probability · Mathematics 2026-03-05 Stanislav Volkov , Magnus Wiktorsson

We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…

Probability · Mathematics 2015-07-07 Jan Vrbik , Paul Vrbik

When facing a heavily-favored opponent, an underdog must be willing to assume greater-than-average risk. In statistical language, one would say that an underdog must be willing to adopt a strategy whose outcome has a larger-than-average…

Physics and Society · Physics 2011-11-04 Brian Skinner

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

Disordered Systems and Neural Networks · Physics 2009-10-31 Johannes Berg

The beautiful theory of statistical gambling, started by Dubins and Savage (for subfair games) and continued by Kelly and Breiman (for superfair games) has mostly been studied under the unrealistic assumption that we live in a continuous…

Probability · Mathematics 2014-11-27 Shalosh B. Ekhad , Doron Zeilberger

We introduce the sequence-set betting game, a generalization of An. A. Muchnik's non-monotonic betting game. Instead of successively partitioning the infinite binary strings by their value of a bit at a chosen position, as in the…

Data Structures and Algorithms · Computer Science 2015-12-23 Tomislav Petrović

Gambles are random variables that model possible changes in monetary wealth. Classic decision theory transforms money into utility through a utility function and defines the value of a gamble as the expectation value of utility changes.…

Economics · Quantitative Finance 2016-02-03 Ole Peters , Murray Gell-Mann

Recently, Press and Dyson have proposed a new class of probabilistic and conditional strategies for the two-player iterated Prisoner's Dilemma, so-called zero-determinant strategies. A player adopting zero-determinant strategies is able to…

Computer Science and Game Theory · Computer Science 2014-02-17 Liming Pan , Dong Hao , Zhihai Rong , Tao Zhou

In an all-pay auction, only one bidder wins but all bidders must pay the auctioneer. All-pay bidding games arise from attaching a similar bidding structure to traditional combinatorial games to determine which player moves next. In contrast…

Computer Science and Game Theory · Computer Science 2015-05-15 Michael Menz , Justin Wang , Jiyang Xie