A Stackelberg game is used to study the service pricing and the strategic behavior of customers in an unreliable and totally unobservable M/M/1 queue under a reward-cost structure. At the first stage, the server manager, acting as a leader, chooses a service price and, at the second stage, a customer, arriving at the system and acting as a follower, chooses to join the system or an outside opportunity, knowing only the service price imposed by the server manager and the system parameters. We show that the constructed game admits an equilibrium and we give explicit forms of server manager and customers equilibrium behavioral strategies. The results of the proposed model show that the assumption that customers are risk-neutral is fundamental ...
We study the equilibrium joining strategies for customers in an M/M/1 queue with working v...
We consider a make-to-stock, finite-capacity production system with setup cost and delay-sensitive c...
Abstract: We consider a memoryless single server queue with two classes of customers, customer types...
This paper considers the customers’ equilibrium and socially optimal joining-balking behavior in sin...
This work investigates the optimal pricing strategies of a server and the equilibrium behavior of cu...
This paper studies an unreliable M/G/1 retrial queue with Bernoulli preventive maintenance, in which...
49 p.An important topic in game theory is inefficiency of Nash equilibria. In this thesis, we apply ...
We consider the customers equilibrium and socially optimal joining-balking behavior in single-server...
We study impatient customers’ joining strategies in a single-server Markovian queue with synchronize...
We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service c...
Queuing theory formalizes a comprehensive framework for studying dynamics of networked systems where...
We study customers’ equilibrium behaviour and social optimization in a single-server Markovian queue...
A queueing system can be represented as a stochastic process, in which events (e.g. arrivals, servic...
We consider a system of two service providers each with a separate queue. Customers choose one queue...
We study the customers' Nash equilibrium behavior in a single server observable queue with a Poisson...
We study the equilibrium joining strategies for customers in an M/M/1 queue with working v...
We consider a make-to-stock, finite-capacity production system with setup cost and delay-sensitive c...
Abstract: We consider a memoryless single server queue with two classes of customers, customer types...
This paper considers the customers’ equilibrium and socially optimal joining-balking behavior in sin...
This work investigates the optimal pricing strategies of a server and the equilibrium behavior of cu...
This paper studies an unreliable M/G/1 retrial queue with Bernoulli preventive maintenance, in which...
49 p.An important topic in game theory is inefficiency of Nash equilibria. In this thesis, we apply ...
We consider the customers equilibrium and socially optimal joining-balking behavior in single-server...
We study impatient customers’ joining strategies in a single-server Markovian queue with synchronize...
We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service c...
Queuing theory formalizes a comprehensive framework for studying dynamics of networked systems where...
We study customers’ equilibrium behaviour and social optimization in a single-server Markovian queue...
A queueing system can be represented as a stochastic process, in which events (e.g. arrivals, servic...
We consider a system of two service providers each with a separate queue. Customers choose one queue...
We study the customers' Nash equilibrium behavior in a single server observable queue with a Poisson...
We study the equilibrium joining strategies for customers in an M/M/1 queue with working v...
We consider a make-to-stock, finite-capacity production system with setup cost and delay-sensitive c...
Abstract: We consider a memoryless single server queue with two classes of customers, customer types...