Related papers: Central limit theorem in complete feedback games

We provide an algorithm to find the value and an optimal strategy of the solitaire variant of the Ten Thousand dice game in the framework of Markov Control Processes. Once an optimal critical threshold is found, the set of non-stopping…

This paper considers the problem of constructing a confidence sequence, which is a sequence of confidence intervals that hold uniformly over time, for estimating the mean of bounded real-valued random processes. This paper revisits the…

In this work, we obtain the central limit theorem for fluctuations of Young diagrams around their limit shape in the bulk of the "spectrum" of partitions of a large integer n (under the Plancherel measure). More specifically, we show that,…

We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…

In 1998, Ciucu published "No-feedback card guessing for dovetail shuffles", an article which gives the optimal guessing strategy for $n$ cards ($n$ even) after $k$ riffle shuffles whenever $k>2\log_{2}\left(n\right)$. We discuss in this…

The aim of this paper is twofold. First, we extend the results of [33] concerning the existence and uniqueness of second-order reflected 2BSDEs to the case of two obstacles. Under some regularity assumptions on one of the barriers, similar…

We carry out a game-theoretic analysis of the recursive game "Guts," a variant of poker featuring repeated play with possibly growing stakes. An interesting aspect of such games is the need to account for funds lost to all players if…

The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…

A key challenge of evolutionary game theory and multi-agent learning is to characterize the limit behavior of game dynamics. Whereas convergence is often a property of learning algorithms in games satisfying a particular reward structure…

We give a simple and general central limit theorem for a triangular array of m-dependent variables. The result requires only a Lindeberg condition and avoids unnecessary extra conditions that have been used earlier. The result applies also…

Let {F_n} be a normalized sequence of random variables in some fixed Wiener chaos associated with a general Gaussian field, and assume that E[F_n^4] --> E[N^4]=3, where N is a standard Gaussian random variable. Our main result is the…

We establish the existence and uniqueness of distributed equilibria to possibly nonsymmetric $N$ player differential games with interactions through controls under displacement semimonotonicity assumptions. Surprisingly, the nonseparable…

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

We consider $\epsilon$-equilibria notions for constant value of $\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that…

We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…

Berry Esseen type bounds to the normal, based on zero- and size-bias couplings, are derived using Stein's method. The zero biasing bounds are illustrated with an application to combinatorial central limit theorems where the random…

For uniformly expanding maps on the interval, analogous versions of the Berry-Ess\'een theorem are known but only with an unexplicit upper bound in $O(1/\sqrt{n})$ without any constants being specified. In this paper, we use the recent…

In a $(1:b)$ Maker-Breaker game, a primary question is to find the maximal value of $b$ that allows Maker to win the game (that is, the critical bias $b^*$). Erd\H{o}s conjectured that the critical bias for many Maker-Breaker games played…

Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on…

One of the prominent open problems in combinatorics is the discrepancy of set systems where each element lies in at most $t$ sets. The Beck-Fiala conjecture suggests that the right bound is $O(\sqrt{t})$, but for three decades the only…