Equilibrium threshold joining strategies in partially observable batch service queueing systems

摘要

We study the strategic customer behavior in queueing systems with batch services under incomplete information. In particular, we assume that arriving customers have the opportunity to observe only the number of waiting batches upon arrival and, afterwards, they make their join/balk decisions. We prove that equilibrium strategies always exist within the legitimate class of threshold strategies, but they may not be unique. We also provide an algorithmic scheme for their computation. Moreover, we compare the strategic behavior under this information level with the corresponding behavior in the complete information case.