\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

Optimal service capacity in a multiple-server queueing system: A game theory approach

Abstract Related Papers Cited by
  • The economic behavior of service providers in a competitive environment is a very important and interesting research topic. A two-server service network has been proposed by Kalai et al. [14] for this purpose. Their model actually aims at studying both the role and impact of service capacity in capturing larger market share. The market share is important in maximizing individual's long-run expected profit. A Markovian queueing system of two servers was employed in their model for the captured problem. The obvious advantage of such a model is that it is mathematically tractable. They then further formulated the problem as a two-person strategic game and analyzed the equilibrium solutions. The main aim of this paper is to extend the results of their two-server queueing model to the case of a general multiple-server queueing model. Here we will focus on the case when the queueing system is stable. It is found that when the marginal cost of service capacity is low relatively to the revenue per customer, a unique Nash equilibrium exists, in which all servers choose the same service capacity and the expected waiting times are finite.
    Mathematics Subject Classification: Primary: 90B22; Secondary: 91A06.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
SHARE

Article Metrics

HTML views() PDF downloads(77) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return