Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities

DOI10.1017/S0269964800004940zbMATH Open1096.60521MaRDI QIDQ5488550FDOQ5488550

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)

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• The use of relative priorities in optimizing the performance of a queueing system
• Waiting times in queues with relative priorities
• Random-order-of-service for heterogeneous customers: waiting time analysis
• Title not available (Why is that?)
• HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES
• Reducing Delay in Retrial Queues by Simultaneously Differentiating Service and Retrial Rates
• Relative priority policies for minimizing the cost of queueing systems with service discrimination
• Equilibrium strategies for placing duplicate orders in a single server queue
• Mean sojourn times for phase-type discriminatory processor sharing systems
• An optimal mechanism charging for priority in a queue
• Stability of a queue with discriminatory random order service discipline and heterogeneous servers
• Charging more for priority via two-part Tariff for accumulating priorities
• Title not available (Why is that?)
• Stable priority purchasing in queues
• A survey on discriminatory processor sharing
• Strategic bidding in an accumulating priority queue: equilibrium analysis
• A method for solving stationary equations for priority time-sharing service process in random environment
• Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms

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)