Service organizations use simulation, pilot studies, and historical data to select service policies that balance aggregate performance and fairness. Existing work primarily evaluates the operational cost of fairness, defined as the performance loss caused by restricting the feasible policy set. In this research, we ide...
Jun-Jie Liu, Ming-Jie Hu, K. Hu et al.· 0 citations
Quantum computing has developed rapidly in recent years and has shown potential advantages over classical computing in various domains. In this paper, we study whether quantum computing can accelerate the convergence rate of discrete simulation optimization in the fixed-budget setting. We first formulate the quantum di...
This work proposes an algorithm that not only tackles the issue of sample average of performance estimates generated by the optimization algorithm, but also provides a consistent online estimator for the variance of the performance.
Teng Lian, Jian-Qiang Hu, Yu-Hang Wu et al.· Naval Research Logistics· 0 citations
The rapid adoption of AI in customer-facing services, such as digital livestreaming, promises efficiency gains but introduces profound socio-technical frictions, including algorithm aversion and trust erosion. This paper develops a two-stage dynamic optimization model of AI-human co-learning over a finite horizon, endo...
Lu-Yao Wang, K. Hu, Jian-Qiang Hu· ACM Transactions on Social C...· 0 citations
A unified large deviations framework for data acquisition in infinite-horizon reinforcement learning is developed and a tractable convex relaxation with explicit constraints is proposed, which proves that the resulting reinforcement learning algorithm is near-robustly optimal under the optimality criterion.