Pure threshold strategies for a two-node tandem network under partial information Articles uri icon

publication date

  • September 2015

start page

  • 467

end page

  • 470

issue

  • 5

volume

  • 43

international standard serial number (ISSN)

  • 0167-6377

abstract

  • In a two node tandem network, customers decide to join or balk by maximizing a given profit function whose costs are proportional to the sojourn time they spend at each queue. Assuming that their choicesare taken without knowing the complete state of the system, we show that a pure threshold equilibrium policy exists. In particular we analyze the case when the partial information consists in informing the arrival customers of the total number of users in the network.

keywords

  • Tandem network
    Individual optimization
    Partial information
    Threshold strategy