English
Related papers

Related papers: Customers' abandonment strategy in an M/G/1 queue

200 papers

We investigate the behavior of equilibria in an $M/M/1$ feedback queue where price and time sensitive customers are homogeneous with respect to service valuation and cost per unit time of waiting. Upon arrival, customers can observe the…

Optimization and Control · Mathematics 2022-02-02 Mark Fackrell , Peter Taylor , Jiesen Wang

Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose…

Optimization and Control · Mathematics 2019-01-11 Tesnim Naceur , Yezekael Hayel

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/$1$ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in…

Computer Science and Game Theory · Computer Science 2017-04-12 Moshe Haviv , Liron Ravner

We consider an M/M/1 feedback queue in which service attempts may fail, requiring the customer to rejoin the queue. Arriving customers act strategically, deciding whether to join the queue based on a threshold strategy that depends on the…

Probability · Mathematics 2025-07-16 Peter Taylor , Jiesen Wang

We study the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed. A Poisson population of customers choose their arrival time with the goal of…

Probability · Mathematics 2021-01-01 Liron Ravner , Yutaka Sakuma

We consider a queuing network that opens at a specified time, where customers are non-atomic and belong to different classes. Each class has its own route, and as is typical in the literature, the costs are a linear function of waiting and…

Performance · Computer Science 2025-12-09 Agniv Bandyopadhyay , Sandeep Juneja

This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…

Probability · Mathematics 2025-02-28 Wathsala Karunarathne , Camiel Koopmans , Jiesen Wang

We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the…

Optimization and Control · Mathematics 2011-12-07 Y. Dimitrakopoulos , A. Burnetas

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…

Computer Science and Game Theory · Computer Science 2025-02-11 Maurizio D'Andrea , Marco Scarsini

This paper studies the equilibrium behavior of customers in the Geo/Geo/1 queueing system with multiple working vacations. The arriving customers decide whether to join or to balk the queueing systems based on the information of the queue…

Probability · Mathematics 2014-04-29 Yang Bixuan , Hou Zhenting , Wu Jinbiao , Liu Zaiming

We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g.\ time zero). There is one server, and the service times are independent and exponentially distributed. The…

Optimization and Control · Mathematics 2017-09-12 Eliran Sherzer , Yoav Kerner

A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the scheduling policy or the state of other queues. A game theoretic…

Optimization and Control · Mathematics 2015-05-07 Rami Atar , Subhamay Saha

Suppose customers need to choose when to arrive to a congested queue with some desired service at the end, provided by a single server that operates only during a certain time interval. We study a model where the customers incur not only…

Probability · Mathematics 2014-06-18 Liron Ravner

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…

Probability · Mathematics 2022-11-15 Liron Ravner , Jiesen Wang

We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…

Theoretical Economics · Economics 2024-10-11 Marco Scarsini , Eran Shmaya

We consider a Markovian clearing queueing system, where the customers are accumulated according to a Poisson arrival process and the server removes all present customers at the completion epochs of exponential service cycles. This system…

Optimization and Control · Mathematics 2011-12-26 Antonis Economou , Athanasia Manou

Many economic transactions, including those of online markets, have a time lag between the start and end times of transactions. Customers need to wait for completion of their transaction (order fulfillment) and hence are also interested in…

Optimization and Control · Mathematics 2018-10-19 Manu K. Gupta , N. Hemachandra

We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume…

Probability · Mathematics 2011-07-13 Olga Boudali , Antonis Economou

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…

Optimization and Control · Mathematics 2018-05-17 Apostolos Burnetas , Yiannis Dimitrakopoulos

Consider a multi-class preemptive-resume $M/D/1$ queueing system that supports advance reservations (AR). In this system, strategic customers must decide whether to reserve a server in advance (thereby gaining higher priority) or avoid AR.…

Computer Science and Game Theory · Computer Science 2018-06-22 Eran Simhon , David Starobinski
‹ Prev 1 2 3 10 Next ›