Related papers: Performance Evaluation of Stochastic Bipartite Mat…
We study a two-stage tandem service queue attended by two servers. Each job-server pair must complete both service phases together, with the server unable to begin a new job until the current one is fully processed after two stages.…
In this paper, we deal with a two-queue polling system attended by a single server. The server visits the queues according to a Markovian routing mechnism. There are two-class customers in the first queue. Customers of each queue are served…
We consider a game of decentralized timing of jobs to a single server (machine) with a penalty for deviation from a due date, and no delay costs. The jobs' sizes are homogeneous and deterministic. Each job belongs to a single decision…
We consider a strategic M/M/1 queueing model under a first-come-first-served regime, where customers are split into two classes and class $A$ has priority over class $B$. Customers can decide whether to join the queue or balk, and, in case…
This paper analyzes a service system modeled as a single-server queue, in which the service provider aims to dynamically maximize the expected revenue per unit of time. This is achieved by constructing a stochastic gradient descent…
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general…
A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival.…
Proceeding from the concept of rational expectations, a new dynamic model of supply and demand in a single market with one supplier, one buyer, and one kind of commodity is developed. Unlike the cob-web dynamic theories with adaptive…
In this paper, we analyse a single server polling model with two queues. Customers arrive at the two queues according to two independent Poisson processes. There is a single server that serves both queues with generally distributed service…
We investigate, under general stationary ergodic assumptions, the stability of systems of $S$ parallel queues in which any incoming customer joins the queue of the server having the $p+1$-th shortest workload ($p < S$), or a free server if…
This paper considers the steady-state performance of load balancing algorithms in a many-server system with distributed queues. The system has $N$ servers, and each server maintains a local queue with buffer size $b-1,$ i.e. a server can…
We study a routing and appointment scheduling problem with uncertain service and travel times arising from home service practice. Specifically, given a set of customers within a service region that an operator needs to serve, we seek to…
We consider a general polling model with $N$ stations. The stations are served exhaustively and in cyclic order. Once a station queue falls empty, the server does not immediately switch to the next station. Rather, it waits at the station…
In several two-sided markets, including labor and dating, agents typically have limited information about their preferences prior to mutual interactions. This issue can result in matching frictions, as arising in the labor market for…
We consider the problem of customer equilibrium behavior of a single server Markovian queue with dynamic control of the service rate. Customers arrive according a Poisson procedure and the system administrator makes a service rate choice…
Assigning tasks to service providers is a frequent procedure across various applications. Often the tasks arrive dynamically while the service providers remain static. Preventing task rejection caused by service provider overload is of…
Cache-aided content delivery is studied in a multi-server system with $P$ servers and $K$ users, each equipped with a local cache memory. In the delivery phase, each user connects randomly to any $\rho$ out of $P$ servers. Thanks to the…
We study a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays $\xi_{i}$. The standard deviation $\sigma$ of the delay is finite, but its value is much larger than the deterministic unit service time.…
The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…
In this paper we study the problem of model reduction by moment matching for stochastic systems. We characterize the mathematical object which generalizes the notion of moment to stochastic differential equations and we find a class of…