SearcharxivSearch

arXiv · 2101.12043

Equilibrium and Socially optimal of a double-sided queueing system with two-mass point matching time

Abstract

We study a passenger-taxi double-ended queue with impatient passengers and two-point matching time in this paper. The system considered in this paper is different from those considered in the existing literature, which fully considers the matching time between passengers and taxis, and the taxi capacity of the system. The objective is to get the equilibrium joining strategy and the socially optimal strategy under two information levels. For the practical consideration of the airport terminal scenario, two different information levels are considered. The theoretical results show that the passenger utility function in the partially observable case is monotonic. For the complex form of social welfare function of the partially observable case, we use a split derivation. The equilibrium strategy and socially optimal strategy of the observable case are threshold-type. Furthermore, some representative numerical scenarios are used to visualize the theoretical results. The numerical scenarios illustrate the influence of parameters on the equilibrium strategy and socially optimal strategy under two information levels. Finally, the optimal social welfare for the two information levels with the same parameters are compared.

Explore related subjects

Keep this discovery

BibTeXRIS

Zhen Wang, Cheryl Yang, Liwei Liu, Yiqiang Q. Zhao. 2021-01-28. Equilibrium and Socially optimal of a double-sided queueing system with two-mass point matching time. https://arxiv.org/abs/2101.12043

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