Related papers: Equilibrium balking strategies for a clearing queu…
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…
Consider an M/M/1-type queue where joining attains a known reward, but a known waiting cost is paid per time unit spent queueing. In the 1960s, Naor showed that any arrival optimally joins the queue if its length is less than a known…
We consider the problem of service rate control of a single server queueing system with a finite-state Markov-modulated Poisson arrival process. We show that the optimal service rate is non-decreasing in the number of customers in the…
We study a recommendation system where sellers compete for visibility by strategically offering commissions to a platform that optimally curates a ranked menu of items and their respective prices for each customer. Customers interact…
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…
We consider a large queueing system that consists of many strategic servers that are weakly interacting. Each server processes jobs from its unique critically loaded buffer and controls the rate of arrivals and departures associated with…
A supermarket game is considered with $N$ FCFS queues with unit exponential service rate and global Poisson arrival rate $N \lambda$. Upon arrival each customer chooses a number of queues to be sampled uniformly at random and joins the…
Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision process instead of a shortest path problem. We propose two…
I develop a continuous-time model in which an incumbent batch-service provider faces stochastic passenger arrivals and must decide when to dispatch under the threat of customer defection to a faster entrant. The incumbent's problem is…
We study the design of decision-making mechanism for resource allocations over a multi-agent system in a dynamic environment. Agents' privately observed preference over resources evolves over time and the population is dynamic due to the…
We model parking in urban centers as a set of parallel queues and overlay a game theoretic structure that allows us to compare the user-selected (Nash) equilibrium to the socially optimal equilibrium. We model arriving drivers as utility…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
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…
We suggest a novel stochastic-approximation algorithm to compute a symmetric Nash-equilibrium strategy in a general queueing game with a finite action space. The algorithm involves a single simulation of the queueing process with dynamic…
We study a supply chain consisting of production-inventory systems at several locations which are coupled by a common supplier. Demand of customers arrives at each production system according to a Poisson process and is lost if the local…
Different populations of vehicles travel along a network. Each population has its origin, destination and travel costs - which may well be unbounded. Under the only requirement of the continuity of the travel costs, we prove the existence…
A system manager makes dynamic pricing and dispatch control decisions in a queueing network model motivated by ride-hailing applications. A novel feature of the model is that it incorporates travel times. Unfortunately, this renders the…
We consider a spatially distributed demand for electrical vehicle recharging, that must be covered by a fixed set of charging stations. Arriving EVs receive feedback on transport times to each station, and waiting times at congested ones,…
We consider Markovian many-server systems with admission control operating in a QED regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine…
We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the…