Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 3 min ago
PreprintCC BY 4.0arXiv

Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options

Abstract

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 on the system state, rather than being static product attributes controlled by the provider. While customers rely on this information when making decisions, they cannot readily verify its accuracy. Consequently, providers may be tempted to manipulate the displayed probabilities to guide customers' choices in their favor, creating a novel lever for demand management. In this work, we model the resulting problem as a sequential decision process, define truthful probabilities recursively, and introduce transparency constraints that limit their distortion. Because the exact computation of truthful probabilities is intractable for realistic settings, we develop an adapted reinforcement learning algorithm to approximate them. Furthermore, we propose a sampling-based mixed-integer program to optimize the information communicated by the provider in each state. Our framework enables providers to gauge the benefits of dynamically disclosing probabilistic information at the time of booking and sheds light on incentives for manipulation. Our computational study is motivated by out-of-home delivery, i.e., the delivery to parcel lockers or shops, and reveals a trade-off between individual-level transparency and aggregate customer utilities.

Related

  1. The Implementation Cost of Fairness in Service Policy Selection
    Junjie Liu, Mingjie Hu, Kejia Hu +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Who pays for urban environment management? The role of the third-party service provider
    Binzhou Yang, Rui Wang, Samuel Ikemba
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Non-asymptotic Convergence of Average-reward Q-learning with Options
    Kintan Saha, Ahana Deb, Anders Jonsson +1
    HALPreprintLicence not statedStatisticsHAL
  4. On the Pricing of American Options under Stochastic Local Volatility and Stochastic Correlation via the RBSDE Framework
    Long Teng
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Multiple Stopping Options on a Geometric Random Walk
    Katsunori Ano
    arXivPreprintarXiv licenceFull textProbabilityarXiv
BibTeX
@misc{sailer2026honesty,
  title = {{Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options}},
  author = {Daniela Sailer and Robert Klein and Claudius Steinhardt},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21351},
  eprint = {2610.21351},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21351},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Honesty is the Best Policy ... or is it? Demand Management for Probabilistic Service Options
AU  - Daniela Sailer
AU  - Robert Klein
AU  - Claudius Steinhardt
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21351
UR  - https://arxiv.org/abs/2610.21351
AB  - 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 on the system state, rather than being static product attributes controlled by the provider. While customers rely on this information when making decisions, they cannot readily verify its accuracy. Consequently, providers may be tempted to manipulate the displayed probabilities to guide customers' choices in their favor, creating a novel lever for demand management. In this work, we model the resulting problem as a sequential decision process, define truthful probabilities recursively, and introduce transparency constraints that limit their distortion. Because the exact computation of truthful probabilities is intractable for realistic settings, we develop an adapted reinforcement learning algorithm to approximate them. Furthermore, we propose a sampling-based mixed-integer program to optimize the information communicated by the provider in each state. Our framework enables providers to gauge the benefits of dynamically disclosing probabilistic information at the time of booking and sheds light on incentives for manipulation. Our computational study is motivated by out-of-home delivery, i.e., the delivery to parcel lockers or shops, and reveals a trade-off between individual-level transparency and aggregate customer utilities.
ER  -