We consider a model in which we have k items to be sold. Potential buyers make offers in a sequential fashion. Once made, the offer is either rejected or marked for acceptance. Once k items have been marked, the items are then sold to the buyers whose offers were marked, but at a price equal to the minimum of the k marked offers. Assuming that the successive offers are independent and identically distributed according to a specified distribution and that there is a fixed cost incurred whenever an offer is rejected, we determine structural results about the optimal policy, present computational approaches for finding the optimal policy, and give some heuristic policies.

Owen's multilinear extension (MLE) of a game is a very important tool in game theory and particularly in the field of simple games. Among other applications it serves to efficiently compute several solution concepts. In this paper we provide bounds for the MLE. Apart from its self-contained theoretical interest, the bounds offer the means in voting system studies of approximating the probability that a proposal is approved in a particular simple game having a complex component arrangement. The practical interest of the bounds is that they can be useful for simple games having a tedious MLE to evaluate exactly, but whose minimal winning coalitions and minimal blocking coalitions can be determined by inspection. Such simple games are quite numerous.

We consider the performance of the delta hedging strategy obtained from a local volatility model when using as input the physical prices instead of the model price process. This hedging strategy is called robust if it yields a superhedge as soon as the local volatility model overestimates the market volatility. We show that robustness holds for a standard Black-Scholes model whenever we hedge a path-dependent derivative with a convex payoff function. In a genuine local volatility model the situation is shown to be less stable: robustness can break down for many relevant convex payoffs including average-strike Asian options, lookback puts, floating-strike forward starts, and their aggregated cliquets. Furthermore, we prove that a sufficient condition for the robustness in every local volatility model is the directional convexity of the payoff function.

Consider a financial market in which an agent trades with utility-induced restrictions on wealth. For a utility function which satisfies the condition of reasonable asymptotic elasticity at -∞, we prove that the utility-based superreplication price of an unbounded (but sufficiently integrable) contingent claim is equal to the supremum of its discounted expectations under pricing measures with finite loss-entropy. For an agent whose utility function is unbounded from above, the set of pricing measures with finite loss-entropy can be slightly larger than the set of pricing measures with finite entropy. Indeed, the former set is the closure of the latter under a suitable weak topology. Central to our proof is a proof of the duality between the cone of utility-based superreplicable contingent claims and the cone generated by pricing measures with finite loss-entropy.

Assume that there are k types of insurance contracts in an insurance company. The ith related claims are denoted by {Xij, j ≥ 1}, i = 1,…,k. In this paper we investigate large deviations for both partial sums S(k; n1,…,nk) = ∑i=1k ∑j=1niXij and random sums S(k; t) = ∑i=1k ∑j=1Ni (t)Xij, where Ni(t), i = 1,…,k, are counting processes for the claim number. The obtained results extend some related classical results.

We consider the generalized version in continuous time of the parking problem of Knuth introduced in Bansaye (2006). Files arrive following a Poisson point process and are stored on a hardware identified with the real line, at the right of their arrival point. Here we study the evolution of the endpoints of the data block straddling 0, which is empty at time 0 and is equal to R at a deterministic time.

Recently Li and Yam (2005) studied which ageing properties for series and parallel systems are inherited for the components. In this paper we provide new results for the increasing convex and concave orders, the increasing mean residual life (IMRL), decreasing failure rate (DFR), the new worse than used in expectation (NWUE), the increasing failure rate in average (IFRA), the decreasing failure rate in average (DFRA), and the new better than used in the convex order (NBUC) ageing classes.

Starting from a sequence of independent Wright-Fisher diffusion processes on [0, 1], we construct a class of reversible infinite-dimensional diffusion processes on Δ∞ := {x ∈ [0, 1]N: ∑i≥1xi = 1} with GEM distribution as the reversible measure. Log-Sobolev inequalities are established for these diffusions, which lead to the exponential convergence of the corresponding reversible measures in the entropy. Extensions are made to a class of measure-valued processes over an abstract space S. This provides a reasonable alternative to the Fleming-Viot process, which does not satisfy the log-Sobolev inequality when S is infinite as observed by Stannat (2000).

We construct a process with gamma increments, which has a given convex autocorrelation function and asymptotically a self-similar limit. This construction validates the use of long-range dependent t and variance-gamma subordinator models for actual financial data as advocated in Heyde and Leonenko (2005) and Finlay and Seneta (2006), in that it allows for noninteger-valued model parameters to occur as found empirically by data fitting.

In this paper we introduce an exponential continuous-time GARCH(p, q) process. It is defined in such a way that it is a continuous-time extension of the discrete-time EGARCH(p, q) process. We investigate stationarity, mixing, and moment properties of the new model. An instantaneous leverage effect can be shown for the exponential continuous-time GARCH(p, p) model.

Continuous-time autoregressive moving average (CARMA) processes with a nonnegative kernel and driven by a nondecreasing Lévy process constitute a very general class of stationary, nonnegative continuous-time processes. In financial econometrics a stationary Ornstein-Uhlenbeck (or CAR(1)) process, driven by a nondecreasing Lévy process, was introduced by Barndorff-Nielsen and Shephard (2001) as a model for stochastic volatility to allow for a wide variety of possible marginal distributions and the possibility of jumps. For such processes, we take advantage of the nonnegativity of the increments of the driving Lévy process to study the properties of a highly efficient estimation procedure for the parameters when observations are available of the CAR(1) process at uniformly spaced times 0,h,…,Nh. We also show how to reconstruct the background driving Lévy process from a continuously observed realization of the process and use this result to estimate the increments of the Lévy process itself when h is small. Asymptotic properties of the coefficient estimator are derived and the results illustrated using a simulated gamma-driven Ornstein-Uhlenbeck process.

In this paper we develop some results presented by Gani (2004), deriving moments for random allocation processes. These moments correspond to the allocation processes reaching some domain boundary. Exact formulae for means, variances, and probability generating functions as well as some asymptotic formulae for moments of random allocation processes are obtained. A special choice of the asymptotics and of the domain allows us to reduce a complicated numerical procedure to a simple asymptotic one.

For τ, a stopping rule adapted to a sequence of n independent and identically distributed observations, we define the loss to be E[q(Rτ)], where Rj is the rank of the jth observation and q is a nondecreasing function of the rank. This setting covers both the best-choice problem, with q(r) = 1(r > 1), and Robbins' problem, with q(r) = r. As n tends to ∞, the stopping problem acquires a limiting form which is associated with the planar Poisson process. Inspecting the limit we establish bounds on the stopping value and reveal qualitative features of the optimal rule. In particular, we show that the complete history dependence persists in the limit; thus answering a question asked by Bruss (2005) in the context of Robbins' problem.

For a spectrally negative Lévy process X on the real line, let S denote its supremum process and let I denote its infimum process. For a > 0, let τ(a) and κ(a) denote the times when the reflected processes Ŷ := S − X and Y := X − I first exit level a, respectively; let τ−(a) and κ−(a) denote the times when X first reaches Sτ(a) and Iκ(a), respectively. The main results of this paper concern the distributions of (τ(a), Sτ(a), τ−(a), Ŷτ(a)) and of (κ(a), Iκ(a), κ−(a)). They generalize some recent results on spectrally negative Lévy processes. Our approach relies on results concerning the solution to the two-sided exit problem for X. Such an approach is also adapted to study the excursions for the reflected processes. More explicit expressions are obtained when X is either a Brownian motion with drift or a completely asymmetric stable process.

We consider the tail behavior of the product of two independent nonnegative random variables X and Y. Breiman (1965) has considered this problem, assuming that X is regularly varying with index α and that E{Yα+ε} < ∞ for some ε > 0. We investigate when the condition on Y can be weakened and apply our findings to analyze a class of random difference equations.

When {Xn} is an irreducible, stationary, aperiodic Markov chain on the countable state space X = {i, j,…}, the study of long-range dependence of any square integrable functional {Yn} := {yXn} of the chain, for any real-valued function {yi: i ∈ X}, involves in an essential manner the functions Qijn = ∑r=1n(pijr − πj), where pijr = P{Xr = j | X0 = i} is the r-step transition probability for the chain and {πi: i ∈ X} = P{Xn = i} is the stationary distribution for {Xn}. The simplest functional arises when Yn is the indicator sequence for visits to some particular state i, Ini = I{Xn=i} say, in which case limsupn→∞n−1var(Y1 + ∙ ∙ ∙ + Yn) = limsupn→∞n−1 var(Ni(0, n]) = ∞ if and only if the generic return time random variable Tii for the chain to return to state i starting from i has infinite second moment (here, Ni(0, n] denotes the number of visits of Xr to state i in the time epochs {1,…,n}). This condition is equivalent to Qjin → ∞ for one (and then every) state j, or to E(Tjj2) = ∞ for one (and then every) state j, and when it holds, (Qijn / πj) / (Qkkn / πk) → 1 for n → ∞ for any triplet of states i, jk.

Expressions for the joint distribution of the longest and second longest excursions as well as the marginal distributions of the three longest excursions in the Brownian bridge are obtained. The method, which primarily makes use of the weak convergence of the random walk to the Brownian motion, principally gives the possibility to obtain any desired joint or marginal distribution. Numerical illustrations of the results are also given.

Aven and Jensen (1999) proposed an approximation to the downtime distribution for arbitrary coherent systems with binary and independent repairable components, where each component follows an alternating renewal process. The approximation is based on a mixture of the duration distributions of the cut sets in the system. We extend this approach to coherent systems composed by multistate independent components, where every component follows a semi-Markov process and where we introduce the concept of a minimal cut set in the multistate setting. We test our proposal on a simple power demand-generation system, by comparing the analytic approximation with simulation results, and we find it is accurate when the system is highly available.

We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating disciplines with exponential service time distributions and (ii) nonpreemptive nonanticipating disciplines with general service time distributions. The unifying conservation law we develop generalizes already existing conservation laws. In addition, it covers popular nonanticipating multi-class time-sharing disciplines such as discriminatory processor sharing (DPS) and generalized processor sharing (GPS) with general service time distributions. As an application, we show that the unifying conservation law can be used to compare the expected unconditional response time under two scheduling disciplines.

The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings computing the well-known Erlang formula for blocking probabilities in these systems becomes intractable for larger resource capacities. Using compound point processes to capture stochastic variability in the request process, we generalize existing models in this framework and derive simple asymptotic expressions for the blocking probabilities. In addition, we extend our model to incorporate reserving resources in advance. Although asymptotic, our experiments show an excellent match between derived formulae and simulation results even for relatively small resource capacities and relatively large values of the blocking probabilities.