Granularity of wagers in games and the (im)possibility of savings

10/12/2018
by   George Barmpalias, et al.
0

In a casino where arbitrarily small bets are admissible, any betting strategy M can be modified into a savings strategy that not only is successful on each casino sequence where M is (thus accumulating unbounded wealth inside the casino) but also saves an unbounded capital, by permanently and gradually withdrawing it from the game. Teutsch showed that this is no longer the case when a minimum wager is imposed by the casino, thus exemplifying a savings paradox where a player can win unbounded wealth inside the casino, but upon withdrawing a sufficiently large amount out of the game, he is forced into bankruptcy. We characterize the rate at which a variable minimum wager should shrink in order for saving strategies to succeed, subject to successful betting: if the minimum wager at stage s shrinks faster than 1/s, then savings are possible; otherwise Teutsch' savings paradox occurs.

READ FULL TEXT
research
01/23/2019

A randomized strategy in the mirror game

Alice and Bob take turns (with Alice playing first) in declaring numbers...
research
09/11/2021

Completeness of Unbounded Best-First Game Algorithms

In this article, we prove the completeness of the following game search ...
research
07/08/2022

An optimal MOO strategy

We calculated a fixed strategy that minimizes the average number of gues...
research
09/26/2019

Gradual learning supports cooperation in spatial prisoner's dilemma game

According to the standard imitation protocol, a less successful player a...
research
03/08/2023

A note on L^1-Convergence of the Empiric Minimizer for unbounded functions with fast growth

For V : ℝ^d →ℝ coercive, we study the convergence rate for the L^1-dista...
research
07/29/2021

Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters

We consider two games between two players Ann and Ben who build a word t...
research
06/30/2022

On the Number of Quantifiers as a Complexity Measure

In 1981, Neil Immerman described a two-player game, which he called the ...

Please sign up or login with your details

Forgot password? Click here to reset