SearcharxivSearch

arXiv · 2105.06192

Estimating customer delay and tardiness sensitivity from periodic queue length observations

Abstract

A single server commences its service at time zero every day. A random number of customers decide when to arrive to the system so as to minimize the waiting time and tardiness costs. The costs are proportional to the waiting time and the tardiness with rates $\alpha$ and $\beta$, respectively. Each customer's optimal arrival time depends on the others' decisions, thus the resulting strategy is a Nash equilibrium. This work considers the estimation of the ratio $\displaystyle\theta\equiv \beta/(\alpha+\beta)$ from queue length data observed daily at discrete time points, given that customers use a Nash equilibrium arrival strategy. A method of moments estimator is constructed from the equilibrium conditions. Remarkably, the method does not require estimation of the Nash equilibrium arrival strategy itself, or even an accurate estimate of its support. The estimator is strongly consistent and the estimation error is asymptotically normal. Moreover, the asymptotic variance of the estimation error as a function of the queue length covariance matrix (at sampling times) is derived. The estimator performance is demonstrated through simulations, and is shown to be robust to the number of sampling instants each day.

Explore related subjects

Keep this discovery

BibTeXRIS

Liron Ravner, Jiesen Wang. 2021-05-13. Estimating customer delay and tardiness sensitivity from periodic queue length observations. https://arxiv.org/abs/2105.06192

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR