In this paper a two-person red-and-black game is investigated. We suppose that, at every stage of the game, player I's win probability, f, is a function of the ratio of his bet to the sum of both players' bets. Two results are given: (i) if f is convex then a bold strategy is optimal for player I when player II plays timidly; and (ii) if f satisfies f(s)f(t) ≤ f(st) then a timid strategy is optimal for player II when player I plays boldly. These two results extend two formulations of red-and-black games proposed by Pontiggia (2005), and also provide a sufficient condition to ensure that the profile (bold, timid) is the unique Nash equilibrium for players I and II. Finally, we give a counterexample to Pontiggia's conjecture about a proportional N-person red-and-black game.

We analyze a periodically inspected system with hidden failures in which the rate of wear is modulated by a continuous-time Markov chain and additional damage is induced by a Poisson shock process. We explicitly derive the system's lifetime distribution and mean time to failure, as well as the limiting average availability. The main results are illustrated in two numerical examples.

In 2002, Benjamin and Goldman gave a complete solution to a variant of the two-player card game Le Her. We extend their result by giving optimal strategies for the authentic version played with a deck consisting of arbitrary numbers of suits and denominations. Additionally, we show that the player who has the advantage in the game when one standard deck is used does not have the advantage if nineteen or more standard decks are used.

This paper is concerned with the analysis of Markov decision processes in which a natural form of termination ensures that the expected future costs are bounded, at least under some policies. Whereas most previous analyses have restricted attention to the case where the set of states is finite, this paper analyses the case where the set of states is not necessarily finite or even countable. It is shown that all the existence, uniqueness, and convergence results of the finite-state case hold when the set of states is a general Borel space, provided we make the additional assumption that the optimal value function is bounded below. We give a sufficient condition for the optimal value function to be bounded below which holds, in particular, if the set of states is countable.

We study the uncertain dichotomous choice model. In this model, a group of expert decision makers is required to select one of two alternatives. The applications of this model are relevant to a wide variety of areas. A decision rule translates the individual opinions of the members into a group decision, and is optimal if it maximizes the probability of the group making a correct choice. In this paper, we assume the correctness probabilities of the experts to be independent random variables selected from some given distribution. Moreover, the ranking of the members in the group is (at least partly) known. Thus, one can follow rules based on this ranking. The extremes are the expert rule and the majority rule. The probabilities of the two extreme rules being optimal were compared in a series of early papers, for a variety of distributions. In most cases, the asymptotic behaviours of the probabilities of the two extreme rules followed the same patterns. Do these patterns hold in general? If not, what are the ranges of possible asymptotic behaviours of the probabilities of the two extreme rules being optimal? In this paper, we provide satisfactory answers to these questions.

In this paper we study discrete-time Markov decision processes with Borel state and action spaces. The criterion is to minimize average expected costs, and the costs may have neither upper nor lower bounds. We first provide two average optimality inequalities of opposing directions and give conditions for the existence of solutions to them. Then, using the two inequalities, we ensure the existence of an average optimal (deterministic) stationary policy under additional continuity-compactness assumptions. Our conditions are slightly weaker than those in the previous literature. Also, some new sufficient conditions for the existence of an average optimal stationary policy are imposed on the primitive data of the model. Moreover, our approach is slightly different from the well-known ‘optimality inequality approach’ widely used in Markov decision processes. Finally, we illustrate our results in two examples.

We consider a class of risk processes with delayed claims, and we provide ruin probability estimates under heavy tail conditions on the claim size distribution.

We show that the maximal expected utility satisfies a monotone continuity property with respect to increasing information. Let be a sequence of increasing filtrations converging to , and let un(x) and u∞(x) be the maximal expected utilities when investing in a financial market according to strategies adapted to and , respectively. We give sufficient conditions for the convergence un(x) → u∞(x) as n → ∞. We provide examples in which convergence does not hold. Then we consider the respective utility-based prices, πn and π∞, of contingent claims under (Gtn) and (Gt∞). We analyse to what extent πn → π∞ as n → ∞.

In an incomplete financial market in which the dynamics of the asset prices is driven by a d-dimensional continuous semimartingale X, we consider the problem of pricing European contingent claims embedded in a power utility framework. This problem reduces to identifying the p-optimal martingale measure, which can be given in terms of the solution to a semimartingale backward equation. We use this characterization to examine two extreme cases. In particular, we find a necessary and sufficient condition, written in terms of the mean-variance trade-off, for the p-optimal martingale measure to coincide with the minimal martingale measure. Moreover, if and only if an exponential function of the mean-variance trade-off is a martingale strongly orthogonal to the asset price process, the p-optimal martingale measure can be simply expressed in terms of a Doléans-Dade exponential involving X.

Define the non-overlapping return time of a block of a random process to be the number of blocks that pass by before the block in question reappears. We prove a central limit theorem based on these return times. This result has applications to entropy estimation, and to the problem of determining if digits have come from an independent, equidistributed sequence. In the case of an equidistributed sequence, we use an argument based on negative association to prove convergence under conditions weaker than those required in the general case.

For stationary sequences X = {Xn}n≥1 we relate τ, the limiting mean number of exceedances of high levels un by X1,…,Xn, and ν, the limiting mean number of upcrossings of the same level, through the expression θ = (ν/τ)η, where θ is the extremal index of X and η is a new parameter here called the upcrossings index. The upcrossings index is a measure of the clustering of upcrossings of u by variables in X, and the above relation extends the known relation θ = ν/τ, which holds under the mild-oscillation local restriction D″(u) on X. We present a new family of local mixing conditions D̃(k)(u) under which we prove that (a) the intensity of the limiting point process of upcrossings and η can both be computed from the k-variate distributions of X; and (b) the cluster size distributions for the exceedances are asymptotically equivalent to those for the lengths of one run of exceedances or the lengths of several consecutive runs which are separated by at most k − 2 nonexceedances and, except for the last one, each contain at most k − 2 exceedances.

In this paper we study players' long-run behaviors in evolutionary coordination games with imperfect monitoring. In each time period, signals corresponding to players' underlying actions, instead of the actions themselves, are observed. A boundedly rational quasi-Bayesian learning process is proposed to extract information from the realized signals. We find that players' long-run behaviors depend not only on the correlations between actions and signals, but on the initial probabilities of risk-dominant and non-risk-dominant equilibria being chosen. The conditions under which risk-dominant equilibrium, non-risk-dominant equilibrium, and the coexistence of both equilibria emerges in the long run are shown. In some situations, the number of limiting distributions grows unboundedly as the population size grows to infinity.

In this paper we obtain central limit theorems for generalized Pólya urn models with L ≥ 2 colors where one out of K different replacements (actions) is applied randomly at each step. Each possible action constitutes a row of the replacement matrix, which can be nonsquare and random. The actions are chosen following a probability distribution given by an arbitrary function of the proportions of the balls of different colors present in the urn. Moreover, under the same hypotheses it is proved that the covariance matrix of the asymptotic distribution is the solution of a Lyapunov equation, and a procedure is given to obtain the covariance matrix in an explicit form. Some applications of these results to random trees and adaptive designs in clinical trials are also presented.

In this paper we propose a new method of determining the stability of queueing systems. We attain it using the absorbing process and introduce the untraceable events method to show the existence of the absorbing process. The advantage of our method is that we are able to discuss the stability of various variables for both discrete and continuous parameters in a general framework with nonstationary input. An untraceable event has the property that the state loses the memory of its origin. In a concrete model, we use the boundedness of the state at an epoch in time with respect to the initial condition and choose the form of the untraceable event corresponding to the input distribution.

A more general definition of MTP2 (multivariate total positivity of order 2) probability measure is given, without assuming the existence of a density. Under this definition the class of MTP2 measures is proved to be closed under weak convergence. Characterizations of the MTP2 property are proved under this more general definition. Then a precise definition of conditionally increasing measure is provided, and closure under weak convergence of the class of conditionally increasing measures is proved. As an application we investigate MTP2 properties of stationary distributions of Markov chains, which are of interest in actuarial science.

We study the ancestral process of a sample from a subdivided population with stochastically varying subpopulation sizes. The sizes of the subpopulations change very rapidly (almost every generation) with respect to the coalescent time scale. For haploid populations of size N, one coalescence time unit corresponds to N generations. Coalescence and migration events occur on the same time scale. We show that, when the total population size tends to infinity, the structured coalescent is obtained, thus confirming the robustness of the coalescent. Many population structure models have been shown to converge to the structured coalescent (see Herbots (1997), Hudson (1998), Nordborg (2001), Nordborg and Krone (2002), and Notohara (1990)).

A generalized correlated random walk is a process of partial sums such that (X, Y) forms a Markov chain. For a sequence (Xn) of such processes in which each takes only two values, we prove weak convergence to a diffusion process whose generator is explicitly described in terms of the limiting behaviour of the transition probabilities for the Yn. Applications include asymptotics of option replication under transaction costs and approximation of a given diffusion by regular recombining binomial trees.

We consider a single-server queueing system at which customers arrive according to a Poisson process. The service times of the customers are independent and follow a Coxian distribution of order r. The system is subject to costs per unit time for holding a customer in the system. We give a closed-form expression for the average cost and the corresponding value function. The result can be used to derive nearly optimal policies in controlled queueing systems in which the service times are not necessarily Markovian, by performing a single step of policy iteration. We illustrate this in the model where a controller has to route to several single-server queues. Numerical experiments show that the improved policy has a close-to-optimal value.

An occupancy model that has arisen in the investigation of randomized distributed schedules in all-optical networks is considered. The model consists of B initially empty urns, and at stage j of the process dj ≤ B balls are placed in distinct urns with uniform probability. Let Mi(j) denote the number of urns containing i balls at the end of stage j. An explicit expression for the joint factorial moments of M0(j) and M1(j) is obtained. A multivariate generating function for the joint factorial moments of Mi(j), 0 ≤ i ≤ I, is derived (where I is a positive integer). Finally, the case in which the dj, j ≥ 1, are independent, identically distributed random variables is investigated.

We consider a family of long-range percolation models (Gp)p>0 on ℤd that allow dependence between edges and have the following connectivity properties for p ∈ (1/d, ∞): (i) the degree distribution of vertices in Gp has a power-law distribution; (ii) the graph distance between points x and y is bounded by a multiple of logpdlogpd|x - y| with probability 1 - o(1); and (iii) an adversary can delete a relatively small number of nodes from Gp(ℤd ∩ [0, n]d), resulting in two large, disconnected subgraphs.