Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment

Sin Man Choi, Ximin Huang, Wai Ki Ching

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We study the optimal demand allocation policies to induce high service capacity and achieve minimum expected sojourn times in equilibrium in a queueing system with multiple strategic servers. We propose the mixed threshold allocation policy as an optimal state-dependent policy that induces optimal service capacity from strategic servers. Compensation to the server can be paid at customer allocation or upon job completion. Our study focuses on the use of a multiple-server mixed threshold allocation policy to replicate the demand of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. The results indicate that, under both payment schemes, for any given multiple-server state-independent policy, there exists a multiple-server threshold policy that produces identical demand allocation and Nash equilibrium (if any). Moreover, the policy can be designed to minimize the expected sojourn time at a symmetric equilibrium. Further-more, under the payment-at-allocation scheme, our results, combining with existing results on the optimality of the multiple-server linear allocation policy, show that the mixed threshold policy can achieve the maximum feasible service capacity and thus the minimum feasible equilibrium expected sojourn time. Hence, our results agree with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.

Original languageEnglish (US)
Pages (from-to)299-323
Number of pages25
JournalJournal of Industrial and Management Optimization
Volume8
Issue number2
DOIs
StatePublished - May 1 2012

Fingerprint

Sojourn Time
Queueing
Servers
Server
Demand
Policy
Queueing System
Incentives
Nash Equilibrium
Completion
Optimality
Customers
Trade-offs
Minimise

Keywords

  • Demand allocation
  • Principal-agent problem
  • Queueing system
  • Strategic server
  • Threshold allocation

Cite this

@article{350d634b6ea747488ae42702f0a869f2,
title = "Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment",
abstract = "We study the optimal demand allocation policies to induce high service capacity and achieve minimum expected sojourn times in equilibrium in a queueing system with multiple strategic servers. We propose the mixed threshold allocation policy as an optimal state-dependent policy that induces optimal service capacity from strategic servers. Compensation to the server can be paid at customer allocation or upon job completion. Our study focuses on the use of a multiple-server mixed threshold allocation policy to replicate the demand of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. The results indicate that, under both payment schemes, for any given multiple-server state-independent policy, there exists a multiple-server threshold policy that produces identical demand allocation and Nash equilibrium (if any). Moreover, the policy can be designed to minimize the expected sojourn time at a symmetric equilibrium. Further-more, under the payment-at-allocation scheme, our results, combining with existing results on the optimality of the multiple-server linear allocation policy, show that the mixed threshold policy can achieve the maximum feasible service capacity and thus the minimum feasible equilibrium expected sojourn time. Hence, our results agree with previous two-server results and affirm that a trade-off between incentives and efficiency need not exist in the case of multiple servers.",
keywords = "Demand allocation, Principal-agent problem, Queueing system, Strategic server, Threshold allocation",
author = "Choi, {Sin Man} and Ximin Huang and Ching, {Wai Ki}",
year = "2012",
month = "5",
day = "1",
doi = "10.3934/jimo.2012.8.299",
language = "English (US)",
volume = "8",
pages = "299--323",
journal = "Journal of Industrial and Management Optimization",
issn = "1547-5816",
publisher = "American Institute of Mathematical Sciences",
number = "2",

}

TY - JOUR

T1 - Minimizing equilibrium expected sojourn time via performance-based mixed threshold demand allocation in a multiple-server queueing environment

AU - Choi, Sin Man

AU - Huang, Ximin

AU - Ching, Wai Ki

PY - 2012/5/1

Y1 - 2012/5/1

N2 - We study the optimal demand allocation policies to induce high service capacity and achieve minimum expected sojourn times in equilibrium in a queueing system with multiple strategic servers. We propose the mixed threshold allocation policy as an optimal state-dependent policy that induces optimal service capacity from strategic servers. Compensation to the server can be paid at customer allocation or upon job completion. Our study focuses on the use of a multiple-server mixed threshold allocation policy to replicate the demand of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. The results indicate that, under both payment schemes, for any given multiple-server state-independent policy, there exists a multiple-server threshold policy that produces identical demand allocation and Nash equilibrium (if any). Moreover, the policy can be designed to minimize the expected sojourn time at a symmetric equilibrium. Further-more, under the payment-at-allocation scheme, our results, combining with existing results on the optimality of the multiple-server linear allocation policy, show that the mixed threshold policy can achieve the maximum feasible service capacity and thus the minimum feasible equilibrium expected sojourn time. Hence, our results agree 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 - We study the optimal demand allocation policies to induce high service capacity and achieve minimum expected sojourn times in equilibrium in a queueing system with multiple strategic servers. We propose the mixed threshold allocation policy as an optimal state-dependent policy that induces optimal service capacity from strategic servers. Compensation to the server can be paid at customer allocation or upon job completion. Our study focuses on the use of a multiple-server mixed threshold allocation policy to replicate the demand of a given state-independent policy to achieve a symmetric equilibrium with lower expected sojourn time. The results indicate that, under both payment schemes, for any given multiple-server state-independent policy, there exists a multiple-server threshold policy that produces identical demand allocation and Nash equilibrium (if any). Moreover, the policy can be designed to minimize the expected sojourn time at a symmetric equilibrium. Further-more, under the payment-at-allocation scheme, our results, combining with existing results on the optimality of the multiple-server linear allocation policy, show that the mixed threshold policy can achieve the maximum feasible service capacity and thus the minimum feasible equilibrium expected sojourn time. Hence, our results agree 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 - Demand allocation

KW - Principal-agent problem

KW - Queueing system

KW - Strategic server

KW - Threshold allocation

UR - http://www.scopus.com/inward/record.url?scp=84861766682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861766682&partnerID=8YFLogxK

U2 - 10.3934/jimo.2012.8.299

DO - 10.3934/jimo.2012.8.299

M3 - Article

AN - SCOPUS:84861766682

VL - 8

SP - 299

EP - 323

JO - Journal of Industrial and Management Optimization

JF - Journal of Industrial and Management Optimization

SN - 1547-5816

IS - 2

ER -