scholarly journals On the Joint Distribution of Stopping Times and Stopped Sums in Multistate Exchangeable Trials

2014 ◽  
Vol 51 (2) ◽  
pp. 483-491 ◽  
Author(s):  
M. V. Boutsikas ◽  
D. L. Antzoulakos ◽  
A. C. Rakitzis

Let T be a stopping time associated with a sequence of independent and identically distributed or exchangeable random variables taking values in {0, 1, 2, …, m}, and let ST,i be the stopped sum denoting the number of appearances of outcome 'i' in X1, …, XT, 0 ≤ i ≤ m. In this paper we present results revealing that, if the distribution of T is known, then we can also derive the joint distribution of (T, ST,0, ST,1, …, ST,m). Two applications, which have independent interest, are offered to illustrate the applicability and the usefulness of the main results.

2014 ◽  
Vol 51 (02) ◽  
pp. 483-491
Author(s):  
M. V. Boutsikas ◽  
D. L. Antzoulakos ◽  
A. C. Rakitzis

Let T be a stopping time associated with a sequence of independent and identically distributed or exchangeable random variables taking values in {0, 1, 2, …, m}, and let S T,i be the stopped sum denoting the number of appearances of outcome 'i' in X 1, …, X T , 0 ≤ i ≤ m. In this paper we present results revealing that, if the distribution of T is known, then we can also derive the joint distribution of (T, S T,0, S T,1, …, S T,m ). Two applications, which have independent interest, are offered to illustrate the applicability and the usefulness of the main results.


Author(s):  
José Correa ◽  
Paul Dütting ◽  
Felix Fischer ◽  
Kevin Schewior

A central object of study in optimal stopping theory is the single-choice prophet inequality for independent and identically distributed random variables: given a sequence of random variables [Formula: see text] drawn independently from the same distribution, the goal is to choose a stopping time τ such that for the maximum value of α and for all distributions, [Formula: see text]. What makes this problem challenging is that the decision whether [Formula: see text] may only depend on the values of the random variables [Formula: see text] and on the distribution F. For a long time, the best known bound for the problem had been [Formula: see text], but recently a tight bound of [Formula: see text] was obtained. The case where F is unknown, such that the decision whether [Formula: see text] may depend only on the values of the random variables [Formula: see text], is equally well motivated but has received much less attention. A straightforward guarantee for this case of [Formula: see text] can be derived from the well-known optimal solution to the secretary problem, where an arbitrary set of values arrive in random order and the goal is to maximize the probability of selecting the largest value. We show that this bound is in fact tight. We then investigate the case where the stopping time may additionally depend on a limited number of samples from F, and we show that, even with o(n) samples, [Formula: see text]. On the other hand, n samples allow for a significant improvement, whereas [Formula: see text] samples are equivalent to knowledge of the distribution: specifically, with n samples, [Formula: see text] and [Formula: see text], and with [Formula: see text] samples, [Formula: see text] for any [Formula: see text].


2005 ◽  
Vol 42 (01) ◽  
pp. 153-162 ◽  
Author(s):  
Christian Y. Robert

Let (Y n , N n ) n≥1 be independent and identically distributed bivariate random variables such that the N n are positive with finite mean ν and the Y n have a common heavy-tailed distribution F. We consider the process (Z n ) n≥1 defined by Z n = Y n - Σ n-1, where It is shown that the probability that the maximum M = max n≥1 Z n exceeds x is approximately as x → ∞, where F' := 1 - F. Then we study the integrated tail of the maximum of a random walk with long-tailed increments and negative drift over the interval [0, σ], defined by some stopping time σ, in the case in which the randomly stopped sum is negative. Finally, an application to risk theory is considered.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Grine Azedine

We consider a sequence(Xi,Yi)1⩽i⩽nof independent and identically distributed random variables with joint cumulative distribution H(x,y), which has exponential marginalsF(x)andG(y)with parameterλ=1. We also assume thatXi(ω)≠Yi(ω),∀i∈N, andω∈Ω. We denoteRk(j)k⩾1andSk(j)k⩾1by the sequences of thejth records in the sequences(Xi)1⩽i⩽n,(Yi)1⩽i⩽n, respectively. The main result of of the paper is to prove the asymptotic independence ofRk(j)k⩾1andSk(j)k⩾1using the property of stopping time of thejth record times and that of the exponential distribution.


1987 ◽  
Vol 24 (01) ◽  
pp. 200-214 ◽  
Author(s):  
Wolfgang Stadje

For a sequence ξ 1 , ξ 2 , · ·· of i.i.d. random variables let X 0 = 0 and X k = max(X k –1 + ξ k , 0) for k = 1, 2, ···. Let . These stopping times are used in Page's (1954) one-sided cusum procedures and are also important in queueing theory. Various asymptotic properties of N x are derived.


1983 ◽  
Vol 26 (3) ◽  
pp. 260-266
Author(s):  
M. Longnecker

AbstractLet {Xn} be a sequence of random variables, not necessarily independent or identically distributed, put and Mn =max0≤k≤n|Sk|. Effective bounds on in terms of assumed bounds on , are used to identify conditions under which an extended-valued stopping time τ exists. That is these inequalities are used to guarantee the existence of the stopping time τ such that E(ST/aτ) = supt ∈ T∞ E(|Sτ|/at), where T∞ denotes the class of randomized extended-valued stopping times based on S1, S2, … and {an} is a sequence of constants. Specific applications to stochastic processes of the time series type are considered.


1987 ◽  
Vol 24 (1) ◽  
pp. 200-214 ◽  
Author(s):  
Wolfgang Stadje

For a sequence ξ1, ξ2, · ·· of i.i.d. random variables let X0 = 0 and Xk = max(Xk–1 + ξ k, 0) for k = 1, 2, ···. Let . These stopping times are used in Page's (1954) one-sided cusum procedures and are also important in queueing theory. Various asymptotic properties of Nx are derived.


1990 ◽  
Vol 27 (04) ◽  
pp. 828-838
Author(s):  
T. P. Hill ◽  
D. P. Kennedy

Optimal stopping of a sequence of random variables is studied, with emphasis on generalized objectives which may be non-monotone functions ofEXt, wheretis a stopping time, or may even depend on the entire vector (E[X1I{t=l}], · ··,E[XnI{t=n}]),such as the minimax objective to maximize minj{E[XjI{t=j}]}.Convexity is used to establish a prophet inequality and universal bounds for the optimal return, and a method for constructing optimal stopping times for such objectives is given.


2020 ◽  
Vol 45 (3) ◽  
pp. 1153-1163
Author(s):  
Ehud Lehrer ◽  
Dimitry Shaiderman

A sequence of random variables is exchangeable if the joint distribution of any finite subsequence is invariant to permutations. De Finetti’s representation theorem states that every exchangeable infinite sequence is a convex combination of independent and identically distributed processes. In this paper, we explore the relationship between exchangeability and frequency-dependent posteriors. We show that any stationary process is exchangeable if and only if its posteriors depend only on the empirical frequency of past events.


1994 ◽  
Vol 31 (04) ◽  
pp. 949-957 ◽  
Author(s):  
Markus Roters

In this paper we review conditions under which Wald's equation holds, mainly if the expectation of the given stopping time is infinite. As a main result we obtain what is probably the weakest possible version of Wald's equation for the case of independent, identically distributed (i.i.d.) random variables. Moreover, we improve a result of Samuel (1967) concerning the existence of stopping times for which the expectation of the stopped sum of the underlying i.i.d. sequence of random variables does not exist. Finally, we show by counterexamples that it is impossible to generalize a theorem of Kiefer and Wolfowitz (1956) relating the moments of the supremum of a random walk with negative drift to moments of the positive part of X 1 to the case where the expectation of X 1 is —∞. Here, the Laplace–Stieltjes transform of the supremum of the considered random walk plays an important role.


Sign in / Sign up

Export Citation Format

Share Document