SearcharxivSearch

arXiv subjects

Royi Jacobovic

Publications and source records attributed to Royi Jacobovic.

At least 19 recordsLinked to original sources

When does admission control reduce congestion? A stochastic ordering approach

Admission control is a widely used mechanism for regulating congestion in stochastic service systems, where restricting arrivals is expected to reduce workload and improve performance. In many settings, however, customers make decisions based on the observed system state, creating a feedback loop between control actions and future arrivals. This raises a fundamental question: does admission control necessarily reduce congestion under state-dependent behavior? We address this question using stochastic ordering of workload processes. We show that admission control may fail to reduce congestion due to endogenous feedback effects, and construct explicit counterexamples illustrating this phenomenon. We then identify a general condition under which admission control is effective over the initial busy period. In particular, independence between customers' types and service requirements eliminates the adverse feedback mechanism and restores stochastic dominance. These results highlight fundamental limitations of admission control and the importance of accounting for behavioral responses in the design of stochastic service systems.

math.OC

Nonparametric inference from possibly unstable M/G/1 workload observations

Hansen and Pitts (2006) introduced the problem of nonparametric estimation of the service-time distribution of an M/G/1 queue observed through its workload process at discrete times $t=0,1,\ldots,n$. Despite its seemingly simple formulation, obtaining an estimator with sharp risk guarantees for this observation model has remained an open challenge for nearly two decades. In this paper, we construct such an estimator and prove that its $L^1$-risk is $\mathcal{O}\left(\frac{\log n}{\sqrt{n}}\right)$ as $n\to\infty$. Remarkably, this nearly parametric convergence rate is achieved without assuming stationarity, stability, or knowledge of the arrival rate. Our approach is based on a two-stage screening procedure that uncovers a hidden conditionally independent compound Poisson structure within the dependent workload observations. This probabilistic reduction transforms the original estimation problem into a classical decompounding problem, making it possible to leverage existing nonparametric estimation techniques despite the complex dependence induced by the reflected workload process. More broadly, we hope that the proposed screening methodology will provide a useful framework for statistical inference from dependent stochastic systems beyond the classical assumption of stability.

math.ST

Useful stochastic bounds in time-varying queues with service and patience times having general joint distribution

Consider a first-come, first-served single server queue with an initial workload $x>0$ and customers who arrive according to an inhomogeneous Poisson process with rate function $\lambda:[0,\infty)\rightarrow[0,\lambda_h ]$ for some $\lambda_h>0$. For each $i\in\mathbb{N}$, let $S_i$ (resp., $Y_i$) be the service (resp., patience) time of the $i$'th customer and assume that $(S_1,Y_1),(S_2,Y_2),\ldots$ is an iid sequence of bivariate random vectors with non-negative coordinates. A customer joins if and only if his patience time is not less than his prospective waiting time (i.e., the left-limit of the workload process at his arrival epoch). Let $\tau(x)$ be the first time when the system becomes empty and let $N^*_\lambda(\cdot)$ be the arrival process of those who join the queue. In the present work we suggest a novel coupling technique which is applied to derive stochastic upper bounds for the functionals: \begin{equation*} \int_0^{\tau(x)}g\circ W_x(t){\rm d}t\ \ \text{and}\ \ \int_0^{\tau(x)}g\circ W_x(t){\rm d}N^*_\lambda(t)\,, \end{equation*} where $W_x(\cdot)$ is the workload process in the queue and $g(\cdot)$ is any lower semi-continuous function. We also demonstrate how to utilise these bounds via some examples under the additional assumption that $\lambda(\cdot)$ is periodic.

math.PR

Bayesian games with nested information

A Bayesian game is said to have nested information if the players are ordered, and each player knows the types of all players that follow her in that order. We prove that all multiplayer Bayesian games with finite actions spaces, bounded payoffs,Polish type spaces, and nested information admit a Bayesian equilibrium.

math.PR

Moments of polynomial functionals of spectrally positive L\'evy processes

Let $J(\cdot)$ be a compound Poisson process with rate $\lambda>0$ and a jumps distribution $G(\cdot)$ concentrated on $(0,\infty)$. In addition, let $V$ be a random variable which is distributed according to $G(\cdot)$ and independent from $J(\cdot)$. Define a new process $W(t)\equiv W_V(t)\equiv V+J(t)-t$, $t\geqslant 0$ and let $\tau_V$ be the first time that $W(\cdot)$ hits the origin. A long-standing open problem due to Iglehart (1971) and Cohen (1979) is to derive the moments of the functional $\int_0^\tau W(t)\,{\rm d}t$ in terms of the moments of $G(\cdot)$ and $\lambda$. In the current work, we solve this problem in much greater generality, i.e., first by letting $J(\cdot)$ belong to a wide class of spectrally positive \color{black} L\'evy processes and secondly, by considering more general class of functionals. We also supply several applications of the existing results, e.g., in studying the process $x\mapsto \int_0^{\tau_x}W_x(t)\,{\rm d}t$ defined on $x\in[0,\infty)$.

math.PR

Minimizing the externalities variance in a LCFS-PR $M/G/1$ queue under various constraints

Consider a LCFS-PR $M/G/1$ queue and assume that at time $t = 0$, there are $n+2$ customers $c_1,c_2,...,c_{n+1},c$ who arrived in that order such that $t = 0$ is the arrival time of $c$. Then, the externalities which are generated by $c$ is the total waiting time that would be saved by $c_1,c_2,...,c_{n+1}$ if $c$ reduced his service requirement to zero. Motivated by some applications, this work is about the minimization of the externalities variance under various constraints.

math.PR

A correlation inequality for random points in a hypercube with some implications

Let $\prec$ be the product order on $\mathbb{R}^k$ and assume that $X_1,X_2,\ldots,X_n$ ($n\geq3$) are i.i.d. random vectors distributed uniformly in the unit hypercube $[0,1]^k$. Let $S$ be the (random) set of vectors in $\mathbb{R}^k$ that $\prec$-dominate all vectors in $\{X_3,..,X_n\}$, and let $W$ be the set of vectors that are not $\prec$-dominated by any vector in $\{X_3,..,X_n\}$. The main result of this work is the correlation inequality \begin{equation*} P(X_2\in W|X_1\in W)\leq P(X_2\in W|X_1\in S)\,. \end{equation*} For every $1\leq i \leq n$ let $E_{i,n}$ be the event that $X_i$ is not $\prec$-dominated by any of the other vectors in $\{X_1,\ldots,X_n\}$. The main inequality yields an elementary proof for the result that the events $E_{1,n}$ and $E_{2,n}$ are asymptotically independent as $n\to\infty$. Furthermore, we derive a related combinatorial formula for the variance of the sum $\sum_{i=1}^n \textbf{1}_{E_{i,n}}$, i.e. the number of maxima under the product order $\prec$, and show that certain linear functionals of partial sums of $\{\textbf{1}_{E_{i,n}};1\leq i\leq n\}$ are asymptotically normal as $n\to\infty$.

math.PR

Externalities in queues as stochastic processes: The case of FCFS M/G/1

Externalities are the costs that a user of a common resource imposes on others. For example, consider a FCFS M/G/1 queue and a customer with service demand of $x\geq0$ minutes who arrived into the system when the workload level was $v\geq0$ minutes. Let $E_v(x)$ be the total waiting time which could be saved if this customer gave up on his service demand. In this work, we analyse the \textit{externalities process} $E_v(\cdot)=\left\{E_v(x):x\geq0\right\}$. It is shown that this process can be represented by an integral of a (shifted in time by $v$ minutes) compound Poisson process with positive discrete jump distribution, so that $E_v(\cdot)$ is convex. Furthermore, we compute the LST of the finite-dimensional distributions of $E_v(\cdot)$ as well as its mean and auto-covariance functions. We also identify conditions under which, a sequence of normalized externalities processes admits a weak convergence on $\mathcal{D}[0,\infty)$ equipped with the uniform metric to an integral of a (shifted in time by $v$ minutes) standard Wiener process. Finally, we also consider the extended framework when $v$ is a general nonnegative random variable which is independent from the arrival process and the service demands. This leads to a generalization of an existing result from a previous work of Haviv and Ritov (1998).

math.PR

A phase transition for the probability of being a maximum among random vectors with general iid coordinates

Consider $n$ iid real-valued random vectors of size $k$ having iid coordinates with a general distribution function $F$. A vector is a maximum if and only if there is no other vector in the sample which weakly dominates it in all coordinates. Let $p_{k,n}$ be the probability that the first vector is a maximum. The main result of the present paper is that if $k\equiv k_n$ is growing at a slower (faster) rate than a certain factor of $\log(n)$, then $p_{k,n} \rightarrow 0$ (resp. $p_{k,n}\rightarrow1$) as $n\to\infty$. Furthermore, the factor is fully characterized as a functional of $F$. We also study the effect of $F$ on $p_{k,n}$, showing that while $p_{k,n}$ may be highly affected by the choice of $F$, the phase transition is the same for all distribution functions up to a constant factor.

math.PR

Recursive construction of a Nash equilibrium in a two-player nonzero-sum stopping game with asymmetric information

We study a discrete-time finite-horizon two-players nonzero-sum stopping game where the filtration of Player 1 is richer than the filtration of Player 2. A major difficulty which is caused by the information asymmetry is that Player 2 may not know whether Player 1 has already stopped the game or not. Furthermore, the classical backward-induction approach is not applicable in the current setup. This is because when the informed player decides not to stop, he reveals information to the uninformed player and hence the decision of the uninformed player at time $t$ may not be determined by the play after time $t$, but also on the play before time $t$. In the current work we initially show that the expected utility of Player 2 will remain the same even if he knows whether Player 1 has already stopped. Then, this result is applied in order to prove that, under appropriate conditions, a recursive construction in the style of Hamad\'ene and Zhang (2010) converges to a pure-strategy Nash equilibrium.

math.OC

A characterization of normality via convex likelihood ratios

This work includes a new characterization of the multivariate normal distribution. In particular, it is shown that a positive density function $f$ is Gaussian if and only if the $f(x+ y)/f(x)$ is convex in $x$ for every $y$. This result has implications to recent research regarding inadmissibility of a test studied by Moran~(1973).

math.ST

Simple sufficient condition for inadmissibility of Moran's single-split test

Suppose that a statistician observes two independent variates $X_1$ and $X_2$ having densities $f_i(\cdot;θ)\equiv f_i(\cdot-θ)\ ,\ i=1,2$ , $θ\in\mathbb{R}$. His purpose is to conduct a test for \begin{equation*} H:θ=0 \ \ \text{vs.}\ \ K:θ\in\mathbb{R}\setminus\{0\} \end{equation*} with a pre-defined significance level $α\in(0,1)$. Moran (1973) suggested a test which is based on a single split of the data, \textit{i.e.,} to use $X_2$ in order to conduct a one-sided test in the direction of $X_1$. Specifically, if $b_1$ and $b_2$ are the $(1-α)$'th and $α$'th quantiles associated with the distribution of $X_2$ under $H$, then Moran's test has a rejection zone \begin{equation*} (a,\infty)\times(b_1,\infty)\cup(-\infty,a)\times(-\infty,b_2) \end{equation*} where $a\in\mathbb{R}$ is a design parameter. Motivated by this issue, the current work includes an analysis of a new notion, \textit{regular admissibility} of tests. It turns out that the theory regarding this kind of admissibility leads to a simple sufficient condition on $f_1(\cdot)$ and $f_2(\cdot)$ under which Moran's test is inadmissible. Furthermore, the same approach leads to a formal proof for the conjecture of DiCiccio (2018) addressing that the multi-dimensional version of Moran's test is inadmissible when the observations are $d$-dimensional Gaussians.

math.ST

Steady-state optimization of an exhaustive Levy storage process with intermittent output and random output rate

Consider a regenerative storage process with a nondecreasing Lévy input (subordinator) such that every cycle may be split into two periods. In the first (off) the output is shut off and the workload accumulates. This continues until some stopping time. In the second (on), the process evolves like a subordinator minus a positive drift (output rate) until it hits the origin. In addition, we assume that the output rate of every on period is a random variable which is determined at the beginning of this period. For example, at each period, the output rate may depend on the workload level at the beginning of the corresponding busy period. We derive the Laplace-Stieltjes transform of the steady state distribution of the workload process and then apply this result to solve a steady-state cost minimization problem with holding, setup and output capacity costs. It is shown that the optimal output rate is a nondecreasing deterministic function of the workload level at the beginning of the corresponding on period.

math.PR

Minimizing a stochastic convex function subject to stochastic constraints and some applications

In the simplest case, we obtain a general solution to a problem of minimizing an integral of a nondecreasing right continuous stochastic process from zero to some nonnegative random variable tau, under the constraints that for some nonnegative random variable T, tau is between zero and T a.s. and the expected value of tau is some alpha. The nondecreasing process and T are allowed to be dependent. In fact a more general setup involving sigma-finite measures, rather than just probability measures is considered and some consequences for families of stochastic processes are given as special cases. Various applications are provided.

math.PR

Regulation of a single-server queue with customers who dynamically choose their service durations

In recent years, there is a growing research about queueing models with customers who choose their service durations. In general, the model assumptions in the existing literature imply that every customer knows his service demand when he enters into the service position. Clearly, this property is not consistent with some real-life situations. Thus, motivated by this issue, this work includes a single-server queueing model with customers who dynamically choose their service durations. In this setup, it is shown how to derive a price-regulation (Pigouvian tax) which implies an optimal resource allocation from a social point of view. In particular, this work includes an efficient procedure for computation of the parameters of this price function.

math.OC

Asymptotic comparison of two-stage selection procedures under quasi-Bayesian framework

This paper revisits the procedures suggested by Dudewicz and Dalal (1975) and Rinott (1978) which are designed for selecting the population with the highest mean among independent Gaussian populations with unknown and possibly different variances. In a previous paper Jacobovic and Zuk (2017) made a conjecture that the relative asymptotic efficiency of these procedures equals to the ratio of two certain sequences. This work suggests a quasi-Bayesian modelling of the problem under which this conjecture is valid. In addition, this paper motivates an open question regarding the extreme value distribution of the maxima of triangular array of independent student-t random variables with an increasing number of degrees of freedom.

math.ST

On The Asymptotic Efficiency of Selection Procedures for Independent Gaussian Populations

The field of discrete event simulation and optimization techniques motivates researchers to adjust classic ranking and selection (R&S) procedures to the settings where the number of populations is large. We use insights from extreme value theory in order to reveal the asymptotic properties of R&S procedures. Namely, we generalize the asymptotic result of Robbins and Siegmund regarding selection from independent Gaussian populations with known constant variance by their means to the case of selecting a subset of varying size out of a given set of populations. In addition, we revisit the problem of selecting the population with the highest mean among independent Gaussian populations with unknown and possibly different variances. Particularly, we derive the relative asymptotic efficiency of Dudewicz and Dalal's and Rinott's procedures, showing that the former can be asymptotically superior by a multiplicative factor which is larger than one, but this factor may be reduced by proper choice of parameters. We also use our asymptotic results to suggest that the sample size in the first stage of the two procedures should be logarithmic in the number of populations.

math.ST

Asymptotic independence of regenerative processes with dependent cycles

We identify general conditions under which regenerative processes with dependent cycles and cycle lengths are asymptotically independent. The result is applied to various models. In particular, independent Lévy processes with dependent secondary jumps at the origin (e.g., workloads of parallel M/G/1 queues with server vacations), the asymptotic performance of real-time status systems with multiple correlated sources measured by the stationary probability of an updated system and asymptotic results for clearing processes with dependent arrivals of inputs and clearings.

math.PR