Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1811.00359

New inequalities for probability functions in the two-person red-and-black game

Włodzimierz Fechner
View original source ↗Read source document ↗Export metadata ↓

Abstract

We discuss a model of a two-person, non-cooperative stochastic game, inspired by the discrete version of the red-and-black gambling problem presented by Dubins and Savage. Assume that two players hold certain amounts of money. At each stage of the game they simultaneously bid some part of their current fortune and the probability of winning or loosing depends on their bids. In many models of the red-and-black game it is assumed that the win probability is a function of the quotient of the bid of the first player and the sum of both bids. In the literature some additional properties, like concavity or super-multiplicativity are assumed in order to ensure that bold and timid strategy is the Nash equilibrium. Our aim is to provide a generalization in which the probability of winning is a two-variable function which depends on both bids. We introduce two new functional inequalities whose solutions lead to win probability functions for which a Nash equilibrium is realized by the bold-timid strategy. Since both inequalities have not easy intuitive meanings, we discuss them in a separate section of the paper and we give there some illustrating examples.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Włodzimierz Fechner. 2018-11-01. New inequalities for probability functions in the two-person red-and-black game. https://arxiv.org/abs/1811.00359

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗
arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗
arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗