Oct 2026· Production and operations management· 0 citations
Abstract
Service platforms frequently employ virtual queues where customers have differing sensitivities to wait times and cannot see their precise positions in line. In these settings, providers often disclose waiting-time information to influence customers' decisions on whether to join or balk. A natural benchmark is to report the long-term average waiting time, yet whether this deterministic disclosure policy is optimal remains unclear when both pricing and customer participation are endogenous. This study develops a stylized theoretical framework to explore the joint structure of pricing and waiting-time information disclosure for service providers managing diverse customers in a virtual queue. The provider decides on both the service price and the waiting-time disclosure policy within a rational-expectations framework. Our findings reveal that the optimal disclosure strategy is captured by scaled Rademacher distributions, meaning at most two distinct announcement values are required. This reduces a complex infinite-dimensional problem to a more manageable finite-dimensional optimization task. Leveraging this framework, we derive the optimal strategies for pricing and disclosure, identifying scenarios where variability in announced waiting times is beneficial. Our analysis shows that noise is advantageous when customers can handle uncertain wait-time signals or initially perceive the service as quick. The optimal level of noise correlates with system congestion, offering the greatest benefits when there is a notable disparity between perceived and actual congestion levels. This provides significant advantages when disclosing waiting times with noise. These findings offer actionable insights for service platforms, guiding them in creating cohesive strategies that encompass pricing, information disclosure, and service configuration, ultimately enhancing customer experience and operational efficiency.
To enable well-informed customer choices and redistribute demand across service options, providers can display probabilities regarding predicted service levels at the time of booking, effectively offering probabilistic service options. In many service settings, the underlying truthful probabilities endogenously depend...
Daniela Sailer, Robert Klein, C. Steinhardt· 0 citations
Across diverse markets, it is important for firms to balance attracting customers with managing operational conditions, such as workloads and delivery times. Dynamic pricing plays a central role in this tradeoff, as the orders generated today can change the conditions faced by future customers. We develop a novel frame...
I study a dynamic pricing problem in which a seller with limited inventory must sequentially price a perishable product for arriving customers with heterogeneous valuations. The key difficulty lies in balancing immediate sales against future opportunities under capacity constraints and stochastic customer valuations. I...
Digital resale platforms allow buyers to either purchase at a posted price or submit a lower offer subject to uncertain seller acceptance. This study develops a stylized finite-horizon dynamic program in which the buyer jointly chooses whether to bid and how much to offer while retaining a buy-now fallback. A savings t...
The growth of e-commerce has intensified the need for last-mile delivery systems that can jointly manage customer choice and operational efficiency. We study the Dynamic Offering and Pricing of Mixed Delivery Options problem, in which a logistics service provider dynamically selects and prices attended home-delivery ti...
Ze Zhou, B. Kulcsár· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.