Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities

DOI10.1017/S0269964800004940MaRDI QIDQ5488550zbMATH OpenFDO

Authors Moshe Haviv, Jan van der Wal

Publication date 22 September 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Equilibrium strategies for queues with impatient customers
• Strategic bidding in an accumulating priority queue: equilibrium analysis
• The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers
• Individual equilibrium and learning in processor sharing systems
• Stable strategies for processor sharing systems

Cites work

• Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
• Purchasing Priorities in Queues
• Reneging from Processor Sharing Systems and Random Queues
• Stable priority purchasing in queues

Cited in

(20)

• Random queues and risk averse users
• The use of relative priorities in optimizing the performance of a queueing system
• Waiting times in queues with relative priorities
• scientific article; zbMATH DE number 7042402 (Why is no real title available?)
• Stable priority purchasing in queues
• Mean sojourn times for phase-type discriminatory processor sharing systems
• Strategic bidding in a discrete accumulating priority queue
• An optimal mechanism charging for priority in a queue
• A method for solving stationary equations for priority time-sharing service process in random environment
• HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
• Stability of a queue with discriminatory random order service discipline and heterogeneous servers
• scientific article; zbMATH DE number 5932241 (Why is no real title available?)
• A survey on discriminatory processor sharing
• Charging more for priority via two-part Tariff for accumulating priorities
• Relative priority policies for minimizing the cost of queueing systems with service discrimination
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
• Random-order-of-service for heterogeneous customers: waiting time analysis
• Strategic bidding in an accumulating priority queue: equilibrium analysis
• Equilibrium strategies for placing duplicate orders in a single server queue
• Reducing delay in retrial queues by simultaneously differentiating service and retrial rates

This page was built for publication: Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488550)