The impact of Inspection cost on equilibrium, revenue, and social welfare in a single-server queue

Refael Hassin*, Ricky Roet-Green

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

60 Scopus citations

Abstract

Classical models of customer decision making in unobservable queues assume acquiring queue length information is too costly. However, due to recent advancements in communication technology, various services now make this kind of information accessible to customers at a reasonable cost. In our model, which reflects this new opportunity, customers choose among three options: join the queue, balk, or inspect the queue length before deciding whether to join. Inspection is associated with a cost. We compute the equilibrium in this model and prove its existence and uniqueness. Based on two normalized parameters-congestion and service valuation-we map all possible input parameter sets into three scenarios. Each scenario is characterized by a different impact of inspection cost on equilibrium and revenue-maximization queue disclosure policy: fully observable (when inspection cost is very low), fully unobservable (when inspection cost is too high), or observable by demand (when inspection cost is at an intermediate level). We show that when maximizing social welfare, the optimal disclosure policy is zero inspection cost. We show the structure remains the same when a fraction of the customers are considered urgent, that is, they always join, whereas the others are nonurgent and therefore join according to their equilibrium strategy.

Original languageEnglish
Pages (from-to)804-820
Number of pages17
JournalOperations Research
Volume65
Issue number3
DOIs
StatePublished - 1 May 2017

Keywords

  • Game theory
  • M/m/1 Markovian queue
  • Queueing theory
  • Strategic customers

Fingerprint

Dive into the research topics of 'The impact of Inspection cost on equilibrium, revenue, and social welfare in a single-server queue'. Together they form a unique fingerprint.

Cite this