TY - GEN
T1 - Self, social and monopoly optimization in observable queues
AU - Hassin, Refael
AU - Snitkovsky, Ran I.
N1 - Publisher Copyright:
© 2017 ACM.
PY - 2017/12/5
Y1 - 2017/12/5
N2 - Naor?s [8] celebrated paper studies customer decisions in an observable M/M/1 queue where customers utility from joining the system is is a linear decreasing function of the joined position in queue. Naor derives the optimal threshold strategies for the individual, social planner and monopoly. The optimal threshold imposed by a monopoly is not greater than the socially optimal threshold, which is not greater than the individual?s threshold. Studies show that this triangular relation holds in a more general setup where the utility function is not necessarily linear. Many of these extensions share common features. We point out conditions that imply the aforementioned result, and apply them to a new model motivated by order-driven markets. In the new model, customers choose between joining and balking when they might be forced to abandon the system before service completion, and the expected value of joining depends on the service completion probability, which is not linear in the observed queue size.
AB - Naor?s [8] celebrated paper studies customer decisions in an observable M/M/1 queue where customers utility from joining the system is is a linear decreasing function of the joined position in queue. Naor derives the optimal threshold strategies for the individual, social planner and monopoly. The optimal threshold imposed by a monopoly is not greater than the socially optimal threshold, which is not greater than the individual?s threshold. Studies show that this triangular relation holds in a more general setup where the utility function is not necessarily linear. Many of these extensions share common features. We point out conditions that imply the aforementioned result, and apply them to a new model motivated by order-driven markets. In the new model, customers choose between joining and balking when they might be forced to abandon the system before service completion, and the expected value of joining depends on the service completion probability, which is not linear in the observed queue size.
KW - Observable Queues
KW - Rational Queueing
UR - http://www.scopus.com/inward/record.url?scp=85051675610&partnerID=8YFLogxK
U2 - 10.1145/3150928.3150949
DO - 10.1145/3150928.3150949
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85051675610
SN - 9781450363464
T3 - ACM International Conference Proceeding Series
SP - 214
EP - 220
BT - Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2017
PB - Association for Computing Machinery
Y2 - 5 December 2017 through 7 December 2017
ER -