Strategic bidding in an accumulating priority queue: equilibrium analysis
From MaRDI portal
(Redirected from Publication:512949)
Abstract: We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in exchange. The priority of each customer in the queue is a linear function of the individual waiting time, with the purchased coefficient being the slope. The unique pure Nash equilibrium is solved explicitly for the case with homogeneous customers. A general characterisation of the Nash equilibrium is provided for the heterogeneous case. It is shown that both avoid the crowd and follow the crowd behaviours are prevalent, within class types and between them. We further present a pricing mechanism that ensures the order of the accumulating priority rates in equilibrium follows a type rule and improves overall efficiency.
Recommendations
- Strategic bidding in a discrete accumulating priority queue
- In-queue priority purchase: a dynamic game approach
- Strategic arrivals to queues offering priority service
- Social welfare and price of anarchy in preemptive priority queues
- Customer equilibrium and optimal strategies in Markovian queues in series
Cites work
- scientific article; zbMATH DE number 3562235 (Why is no real title available?)
- A Dynamic Priority Queue with General Concave Priority Functions
- A Mixed Delay Dependent Queue Discipline
- A course in game theory.
- A delay dependent queue discipline
- Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems
- Decentralized Regulation of a Queue
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Equilibrium Points in Nonzero-Sum n-Person Submodular Games
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
- Pricing and priority auctions in queueing systems with a generalized delay cost structure
- Probability. Theory and examples.
- Purchasing Priorities in Queues
- Queues. A course in queueing theory
- Stable priority purchasing in queues
- Time Dependent Priority Queues
- To queue or not to queue: equilibrium behavior in queueing systems.
- Waiting time distributions in the accumulating priority queue
- S-modular games, with queueing applications
Cited in
(18)- Auctioning and selling positions: a non-cooperative approach to queueing conflicts
- Inefficiency in stochastic queueing systems with strategic customers
- Customer equilibrium in a single-server system with virtual and system queues
- Social welfare and price of anarchy in preemptive priority queues
- Strategic arrivals to queues offering priority service
- Endogenous queue number determination in \(G/m/s\) systems
- On a multiple priorities matching system with heterogeneous delay sensitive individuals
- In-queue priority purchase: a dynamic game approach
- An optimal mechanism charging for priority in a queue
- Charging more for priority via two-part Tariff for accumulating priorities
- The lower-class waiting time distribution in the delayed accumulating priority queue
- Strategic bidding in a discrete accumulating priority queue
- Pre-announced posted pricing scheme: existence and uniqueness of equilibrium bidding strategy
- Lowest priority waiting time distribution in an accumulating priority Lévy queue
- Stable priority purchasing in queues
- Priority auctions and queue disciplines that depend on processing time
- Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
- Strategic Equilibrium for a Pair of Competing Servers with Convex Cost and Balking
This page was built for publication: Strategic bidding in an accumulating priority queue: equilibrium analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512949)
