Service Networks with Open Routing and Procedurally Rational Customers

Problem Definition: We investigate the implications of procedurally rational customers on service networks where customers visit multiple stations but can choose the order in which to visit the stations. Academic/Practical Relevance: Self-interested customers populate various service systems. While self-interested, these customers may not be fully rational. Customers' form of reasoning and its consequences for system performance affect the planning decisions of service providers. Methodology: We study procedurally rational customers---that is, customers make decisions based on anecdotal samples of system times experienced by customers who previously visited the system and followed each possible route. Using a fluid model, we fully characterize the evolution of customer routing decisions, with customers deciding in each period based on samples from the previous period. Results: We completely specify the set of equilibrium routing profiles, where the fraction of customers choosing each route becomes stationary. In contrast with existing models of procedural rationality, we find that procedurally rational customers sometimes behave differently from fully rational customers, but not always. Equilibria can emerge under procedural rationality that differ from fully rational equilibria, in which case, system performance suffers. We also study systems in which customers make routing decisions. We find analytically that procedurally rational customers are slower to internalize price increases than fully rational customers: accordingly, the firm's optimal revenue is higher (lower) with procedurally rational customers than fully rational ones if the waiting cost is high (low). Managerial Implications: In systems in which customers make only routing decisions, procedural rationality can lead to much longer waiting times. However, the firm can avoid increased waiting times if it can choose the service rates at its stations. Furthermore, if customers make joining decisions, then a service provider should price differently depending on which form of reasoning customers use, and the firm may prefer either procedurally rational customers or fully rational ones depending on the system parameters.

[1]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[2]  P. Naor The Regulation of Queue Size by Levying Tolls , 1969 .

[3]  A. Tversky,et al.  BELIEF IN THE LAW OF SMALL NUMBERS , 1971, Pediatrics.

[4]  Mark E. Ferguson,et al.  PRODUCTION AND OPERATIONS MANAGEMENT , 2008 .

[5]  Joel E. Cohen,et al.  A paradox of congestion in a queuing network , 1990, Journal of Applied Probability.

[6]  A. Rubinstein,et al.  Games with Procedurally Rational Players , 1997 .

[7]  Moshe Asher Pollatschek,et al.  Using Simulation to Increase Efficiency in an Army Recruitment Office , 2001, Interfaces.

[8]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[9]  Sunil Kumar,et al.  Self-Interested Routing in Queueing Networks , 2004, Manag. Sci..

[10]  Xuanming Su,et al.  Patient Choice in Kidney Allocation: The Role of the Queueing Discipline , 2004, Manuf. Serv. Oper. Manag..

[11]  Ran Spiegler,et al.  The market for quacks , 2006 .

[12]  Xuanming Su,et al.  Bounded Rationality in Newsvendor Models , 2007, Manuf. Serv. Oper. Manag..

[13]  Tingliang Huang,et al.  Service Systems with Experience‐Based Anecdotal Reasoning Customers , 2015 .

[14]  Xuanming Su,et al.  Modeling Bounded Rationality in Capacity Allocation Games with the Quantal Response Equilibrium , 2011, Manag. Sci..

[15]  Martin A. Lariviere,et al.  Saving Seats for Strategic Customers , 2013, Oper. Res..

[16]  Gad Allon,et al.  Bounded Rationality in Service Systems , 2013, Manuf. Serv. Oper. Manag..

[17]  Yimin Yu,et al.  Sell Probabilistic Goods? A Behavioral Explanation for Opaque Selling , 2014, Mark. Sci..

[18]  Senthil K. Veeraraghavan,et al.  A Model of Rational Retrials in Queues , 2014, Oper. Res..

[19]  Rahul Jain,et al.  Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game , 2011, Oper. Res..

[20]  Pengfei Guo,et al.  Quality-Speed Competition in Customer-Intensive Services with Boundedly Rational Customers , 2016 .

[21]  Oded Berman,et al.  Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis , 2017, Manuf. Serv. Oper. Manag..

[22]  Ying-Ju Chen,et al.  Managing Posterior Price Matching: The Role of Customer Boundedly Rational Expectations , 2016, Manuf. Serv. Oper. Manag..

[23]  Varun Gupta,et al.  Trading Time in a Congested Environment , 2017, Manag. Sci..

[24]  Leela Nageswaran,et al.  Queues with Redundancy: Is Waiting in Multiple Lines Fair? , 2017 .

[25]  Asuman E. Ozdaglar,et al.  Informational Braess' Paradox: The Effect of Information on Traffic Congestion , 2016, Oper. Res..

[26]  Tingliang Huang,et al.  Managing Service Systems with Unknown Quality and Customer Anecdotal Reasoning , 2016 .

[27]  Hang Ren,et al.  Modeling Customer Bounded Rationality in Operations Management: A Review and Research Opportunities , 2017, Comput. Oper. Res..

[28]  Liu Yang,et al.  Service Pricing with Loss-Averse Customers , 2018, Oper. Res..

[29]  Ran I. Snitkovsky,et al.  Tipping in Service Systems: The Role of a Social Norm , 2018 .

[30]  S. Gilbert,et al.  Pricing, Quality and Competition at On-Demand Healthcare Service Platforms , 2018 .

[31]  Jaelynn Oh,et al.  Reservation Policies in Queues: Advance Deposits, Spot Prices, and Capacity Allocation , 2018 .

[32]  Yehua Wei,et al.  Strategic Open Routing in Service Networks , 2017, Manag. Sci..

[33]  Laurens G. Debo,et al.  Referral Priority Program: Leveraging Social Ties via Operational Incentives , 2019, Manag. Sci..

[34]  Katia Sycara,et al.  Jumping the Line, Charitably: Analysis and Remedy of Donor-Priority Rule , 2020, Manag. Sci..