Stable strategies for processor sharing systems

DOI10.1016/0377-2217(91)90340-2zbMath0726.68011OpenAlexW2072852838MaRDI QIDQ802859

Moshe Haviv

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90340-2

zbMATH Keywords

balking in queuesprocessor sharing systemsstable strategies

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Non zero-sum stochastic games in admission, service and routing control in queueing systems, Zero-sum Markov games and worst-case optimal control of queueing systems, Capacity competition of make-to-order firms

Cites Work

• Stable priority purchasing in queues
• ?/M/1: On the equilibrium distribution of customer arrivals
• Reneging from Processor Sharing Systems and Random Queues
• Unnamed Item
• Unnamed Item
• Unnamed Item