A private good/public good decomposition for optimal flow control of an<tex>M/M/1</tex>queue

DOI10.1109/TAC.1985.1103835MaRDI QIDQ3706803zbMATH OpenFDO

Authors Beverly A. Sanders

Publication date 1985

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

zbMATH Keywords

flow controlM/M/1 queueincentive compatible hill climbing algorithmprivate good algorithmpublic good algorithmseveral users

Mathematics Subject Classification ID

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

Recommendations

• Optimal flow control of an M/M/1 queue with a balanced budget
• Optimal Flow Control of an M/M/ m Queue
• A paradox in optimal flow control of \(M/M/n\) queues
• Worst-Case Efficiency Analysis of Queueing Disciplines
• Control of \(M|M|1|N\) queue parameters under constraints

Cited in

(3)

• Optimal flow control of an M/M/1 queue with a balanced budget
• The complexity of resource allocation and price mechanisms under bounded rationality
• Worst-Case Efficiency Analysis of Queueing Disciplines

This page was built for publication: A private good/public good decomposition for optimal flow control of an&lt;tex&gt;M/M/1&lt;/tex&gt;queue

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