In Benaïm and Ben Arous (2003) is solved a multi-armed bandit problem arising in the theory of learning in games. We propose a short and elementary proof of this result based on a variant of the Kronecker lemma.
In Benaïm and Ben Arous (2003) is solved a multi-armed bandit problem arising in the theory of learning in games. We propose a short and elementary proof of this result based on a variant of the Kronecker lemma.
Suppose that the process is observed sequentially. There are two random moments of time and , independent of X, and X is a Markov process given and . The transition probabilities of X change for the first time at time and for the second time at time . Our objective is to find a strategy which immediately detects the distribution changes with maximal probability based on observation of X. The corresponding problem of double optimal stopping is constructed. The optimal strategy is found...
We consider the coarse-graining of a lattice system with continuous spin variable. In the first part, two abstract results are established: sufficient conditions for a logarithmic Sobolev inequality with constants independent of the dimension (Theorem 3) and sufficient conditions for convergence to the hydrodynamic limit (Theorem 8). In the second part, we use the abstract results to treat a specific example, namely the Kawasaki dynamics with Ginzburg–Landau-type potential.
This article deals with the three classic policies for an M/G/1 queueing system (N, T, and D-policy). The optimum policies were compared in several precedent studies, but the comparison was performed employing different cost functions, so that the D-policy is superior to the N-policy when the cost function is based on the mean work-load, whilst the average queue length is used to show the superiority of the N-policy over the T-policy. In order to achieve a comparison of the three policies under...
Niemiro and Zieliński (2007) have recently obtained uniform asymptotic normality for the Bernoulli scheme. This paper concerns a similar problem. We show the uniform central limit theorem for a sequence of stationary random variables.
Given a two-dimensional fractional multiplicative process determined by two Hurst exponents and , we show that there is an associated uniform Hausdorff dimension result for the images of subsets of by if and only if .
There are two kinds of universal schemes for estimating residual waiting times, those where the error tends to zero almost surely and those where the error tends to zero in some integral norm. Usually these schemes are different because different methods are used to prove their consistency. In this note we will give a single scheme where the average error is eventually small for all time instants, while the error itself tends to zero along a sequence of stopping times of density one.
By the method of Rio [10], for a locally square integrable periodic function f, we prove for almost every x and t > 0.