User equilibria for a parallel queueing system with state dependent routing
From MaRDI portal
This paper presents a complete mathematical formulation and solution for user equilibrium for a parallel queuing system with state dependent routing problem. A number of proofs of existence, uniqueness and monotonicity properties for state dependent equilibrium are considered in the paper. The numerical experiments are interesting and several interesting features are illustrated and nicely explained.
Recommendations
- Monotonicity properties of user equilibrium policies for parallel batch systems
- A paradox in a queueing network with state-dependent routing and loss
- Probabilistic selfish routing in parallel batch and single-server queues
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
Cites work
- A paradox of congestion in a queuing network
- A survey of Markov decision models for control of networks of queues
- Analysis and comparison of queues with different levels of delay information
- Braess's paradox in a queueing network with state-dependent routing
- Deciding Which Queue to Join: Some Counterexamples
- Dynamic service sharing with heterogeneous preferences
- Equilibrium customers' choice between FCFS and random servers
- How bad is selfish routing?
- scientific article; zbMATH DE number 837692 (Why is no real title available?)
- scientific article; zbMATH DE number 2202833 (Why is no real title available?)
- Improving service by informing customers about anticipated delays
- Individual equilibrium and learning in processor sharing systems
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Individually optimal routing in parallel systems
- INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM
- Nash equilibrium and subgame perfection in observable queues
- On the Nash equilibria for the FCFS queueing system with load-increasing service rate
- Optimal control of two interacting service stations
- Optimality of the shortest line discipline
- Self-interested routing in queueing networks
- Structural results for the control of queueing systems using event-based dynamic programming
- The Downs-Thomson Effect in a Markov Process
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- The Impact of Delay Announcements in Many-Server Queues with Abandonment
- The Regulation of Queue Size by Levying Tolls
- To queue or not to queue: equilibrium behavior in queueing systems.
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
Cited in
(13)- Selfish routing in public services
- Probabilistic selfish routing in parallel batch and single-server queues
- Equilibrium joining strategies in batch service queueing systems
- Customer behavior analysis in ticket windows at scenic spots from game-theoretic perspective
- Equilibrium threshold joining strategies in partially observable batch service queueing systems
- Strategic customer behavior in a two-stage batch processing system
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control
- Monotonicity properties of user equilibrium policies for parallel batch systems
- INDIVIDUAL EQUILIBRIUM DYNAMIC ROUTING IN A MULTIPLE SERVER RETRIAL QUEUE
- The Downs-Thomson Effect in a Markov Process
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
- A paradox in a queueing network with state-dependent routing and loss
This page was built for publication: User equilibria for a parallel queueing system with state dependent routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600903)
