In this work, we study an $$M/M/1$$ ticket queue with a clearance time for balking customers that follows the exponential distribution. The customers’ join/balk decisions depend on the total queue length that they observe upon arrival. The latter leads to a queue with two types of customers, with the type being decided according to the queue length upon arrival. We obtain the steady-state distribution applying when customers use a threshold strategy. We show that the conditional distributions of the tail of the queue given its head can be constructed as mixtures and sums of geometric distributions. We analyze the individual best response and check whether a threshold strategy is an equilibrium, for given values of the clearance rate.
Strategic behavior in a Markovian ticket queue with non-negligible clearance times. // Biological Research. – 2026. – DOI: 10.1007/s11134-026-09996-z. – URL: https://link.springer.com/article/10.1007/s11134-026-09996-z
(2026). Strategic behavior in a Markovian ticket queue with non-negligible clearance times. Biological Research. https://doi.org/10.1007/s11134-026-09996-z
“Strategic behavior in a Markovian ticket queue with non-negligible clearance times.” Biological Research, 2026. doi:10.1007/s11134-026-09996-z.
@article{article32568,
title = {Strategic behavior in a Markovian ticket queue with non-negligible clearance times},
journal = {Biological Research},
year = {2026},
doi = {10.1007/s11134-026-09996-z},
url = {https://link.springer.com/article/10.1007/s11134-026-09996-z}
}
We introduce several dynamic models of sources of “posts” publishing them on a “newsfeed” in e.g. some social media. All of them have a product-form stationary distribution. We define four metrics relevant to these newsfeeds and compute...
We study a restricted version of the Erlang-R queueing model that has both server and space constraints, in which the space restriction is administered by two types of admission policies: blocking or holding in a pre-entrant queue. This...
Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean...
Semimartingale reflecting Brownian motions (SRBMs) are an integral part of queueing theory. Fluid paths are a standard tool for demonstrating positive recurrence of SRBMs, and their convergence provides both necessary and sufficient...
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying...