Social and Monopoly Optimization in Observable Queues

• 成果类型: Article
• 署名作者: Hassin, Refael; Snitkovsky, Ran I.
• 署名单位: Tel Aviv University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2019.1907
• 发表日期: 2020
• 页码: 1178-1198
• 关键词: observable queues; Naor's inequality; optimal admission

摘要

Naor's celebrated paper studies customer decisions in an observable M/M/1 queue in which joining-customers utility is linearly decreasing with the joining position. Naor derives the optimal threshold strategies for the individuals, social planner, and monopolist and proves that the monopoly optimal threshold is (weakly) smaller than the socially optimal threshold, which is (weakly) smaller than the individually optimal one. Studies show, based on numerical observations and/or ad hoc proof techniques, that this triangular relation holds within various specific setups, in which the queuing process is not M/M/1 and/or when the utility is not linear. We point out properties that imply the aforementioned result in Naor'smodel and its extensions and suggestmodel applications for our findings. Our formulation gives strictly stronger results than those currently appearing in the literature. We further provide simple examples in which the inequality does not hold.