Reneging from Processor Sharing Systems and Random Queues

DOI10.1287/MOOR.15.1.129MaRDI QIDQ4712850zbMATH OpenOpenAlexFDO

Authors David Assaf, Moshe Haviv

Publication date 25 June 1992

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.15.1.129

zbMATH Keywords

Nash equilibriumprocessor sharing systemsrandom queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Cited in

(14)

• Mathematical problems in the theory of processor-sharing queueing systems
• A polling model with reneging at polling instants
• In-queue priority purchase: a dynamic game approach
• Rational joining behavior in a queueing system with abandonments
• An equilibrium analysis of a discrete-time Markovian queue with endogenous abandonments
• The value of reneging for strategic customers in queueing systems with server vacations/failures
• A queueing model for managing small projects under uncertainties
• Impatience in Single Server Queueing Model
• An equilibrium analysis of a multiclass queue with endogenous abandonments in heavy traffic
• STRATEGIC CUSTOMERS IN MARKOVIAN QUEUES WITH VACATIONS AND SYNCHRONIZED ABANDONMENT
• Strategic experimentation in queues
• Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
• Strategic reneging in service systems with working breakdowns
• Stable strategies for processor sharing systems

This page was built for publication: Reneging from Processor Sharing Systems and Random Queues

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