A private good/public good decomposition for optimal flow control of anM/M/1queue

1 November 1985

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control

Vol. 30 (11) , 1143-1145
https://doi.org/10.1109/tac.1985.1103835

Abstract

Flow control for an M/M/1 queue with several users conceptually consists of two parts: determining the total throughput (and thus mean delay) and determining the rate allocated to each individual user. An incentive compatible hill climbing algorithm that determines the optimal rate allocation is presented. It is shown that the algorithm can be viewed as a public good algorithm that determines the total, and a private good algorithm that determines the allocation, operating simultaneously.

Keywords

This publication has 4 references indexed in Scilit:

An incentive-compatible modification of the heal algorithm
Optimal Control Applications and Methods, 1983
A control-theoretic view on incentives
Automatica, 1982
A Tatonement Process for Public Goods
The Review of Economic Studies, 1971
Planning without Prices
The Review of Economic Studies, 1969