Loading…

The Effect of Loss Preference on Queueing with Information Disclosure Policy

In this paper, we incorporate loss preference into an M/M/1 queueing with a threshold disclosure policy and analyze its impact on the customers’ queueing strategies and the queueing system’s idle stationary probability. In the queueing system, customers are strategic and divided into two groups: the...

Full description

Saved in:
Bibliographic Details
Published in:Methodology and computing in applied probability 2023-09, Vol.25 (3), p.75, Article 75
Main Authors: Cao, Jian, Guo, Yongjiang, Hu, Zhongxin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we incorporate loss preference into an M/M/1 queueing with a threshold disclosure policy and analyze its impact on the customers’ queueing strategies and the queueing system’s idle stationary probability. In the queueing system, customers are strategic and divided into two groups: the informed and the uninformed. Informed customers are assumed to be fully rational, whereas uninformed customers are assumed to have loss preference. Uninformed customers with loss preference are categorized into two types according to their asymmetry perceptions, which anchor on the difference between gain and loss: loss neutrality and loss aversion. We firstly determine customers’ equilibrium decisions, and then derive the idle stationary probability at equilibrium. We find that loss preference reduces the customers’ joining probability, and results in a higher idle stationary probability. Furthermore, we find that for the uninformed customers with stronger loss aversion, the system manager should lower the threshold of disclosure to maintain a stable demand of uninformed customers. In addition, in the case of mixed-strategy at equilibrium, with the increase of the threshold of disclosure, the idle stationary probability increases for an underloaded queue. However, for an overloaded queue, the idle stationary probability decreases with increasing the threshold of disclosure.
ISSN:1387-5841
1573-7713
DOI:10.1007/s11009-023-10047-w