TY - GEN
T1 - Inducing optimal service capacities via performance-based allocation of demand in a queueing system with multiple servers
AU - Choi, Sin M.
AU - Huang, Ximin
AU - Ching, Wai K.
PY - 2010
Y1 - 2010
N2 - In this paper, we study the use of performance-based allocation of demand in a multiple-server queueing system. The same problem with two servers have been studied in the literature. Specifically, it has been proposed and proved that the linear allocation and mixed threshold allocation policies are, respectively, the optimal state-independent and state-dependent allocation policy in the two-server case. The multiple-server linear allocation has also been shown to be the optimal state-independent policy with multiple servers. In our study, we focus on the use of a multiple-server mixed threshold allocation policy to replicate the demand allocation of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. Our results indicate that, for any given multiple-server state-independent policy that prohibits server overloading, there exists a multiple-server mixed threshold policy that gives the same demand allocation and thus have the same Nash equilibrium (if any). Moreover, such a policy can be designed so that the expected sojourn time at a symmetric equilibrium is minimized. Therefore, our results concur with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.
AB - In this paper, we study the use of performance-based allocation of demand in a multiple-server queueing system. The same problem with two servers have been studied in the literature. Specifically, it has been proposed and proved that the linear allocation and mixed threshold allocation policies are, respectively, the optimal state-independent and state-dependent allocation policy in the two-server case. The multiple-server linear allocation has also been shown to be the optimal state-independent policy with multiple servers. In our study, we focus on the use of a multiple-server mixed threshold allocation policy to replicate the demand allocation of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. Our results indicate that, for any given multiple-server state-independent policy that prohibits server overloading, there exists a multiple-server mixed threshold policy that gives the same demand allocation and thus have the same Nash equilibrium (if any). Moreover, such a policy can be designed so that the expected sojourn time at a symmetric equilibrium is minimized. Therefore, our results concur with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.
KW - Game theory
KW - Queueing system
KW - Threshold allocation
UR - http://www.scopus.com/inward/record.url?scp=78651459986&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651459986&partnerID=8YFLogxK
U2 - 10.1109/ICCIE.2010.5668332
DO - 10.1109/ICCIE.2010.5668332
M3 - Conference contribution
AN - SCOPUS:78651459986
SN - 9781424472956
T3 - 40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010
BT - 40th International Conference on Computers and Industrial Engineering
T2 - 40th International Conference on Computers and Industrial Engineering, CIE40 2010
Y2 - 25 July 2010 through 28 July 2010
ER -