Research

2023

1. Content Promotion for Online Content Platforms with Network Diffusion Effect

   Yunduan Lin, Mengxin Wang, Zuo-Jun Max Shen, Heng Zhang, and Renyu Philip Zhang

   Minor Revision at Manufacturing & Service Operations Management

   2023

   🏆 Winner, Best Student Paper of Social Media Analytics, INFORMS 2022
   🏆 Second place, OR/MS Tomorrow Mini-poster Competition, 2022
   

   Abstract SSRN Poster

   Problem Definition: Content promotion policies are crucial for online content platforms to improve content consumption and user engagement. However, traditional promotion policies generally neglect the diffusion effect within a crowd of users. In this paper, we study the candidate generation and promotion optimization (CGPO) problem for an online content platform, emphasizing the incorporation of the diffusion effect.
   Methodology: We propose a diffusion model that incorporates platform promotion decisions to characterize the adoption process of online content. Based on this diffusion model, we formulate the CGPO problem as a mixed-integer program with nonconvex and nonlinear constraints, which is proved to be NP-hard. Additionally, we investigate methods for estimating the diffusion model parameters using available online platform data and introduce novel double ordinary least squares (D-OLS) estimators.
   Results: We prove the submodularity of the objective function for the CGPO problem, which enables us to find an efficient (1-1/e)-approximation greedy solution. Furthermore, we demonstrate that the D-OLS estimators are consistent and have smaller asymptotic variances than traditional OLS estimators. By utilizing real data from a large-scale video-sharing platform, we show that our diffusion model effectively characterizes the adoption process of online content. Compared to the policy actually implemented on the platform, our proposed promotion policy increases total adoption by 49.90%.
   Managerial Implications: Our research highlights the essential role of diffusion in online content and provides actionable insights for online content platforms to optimize their content promotion policies by leveraging our diffusion model.

2. Daily Physical Activity Monitoring—Adaptive Learning from Multi-source Motion Sensor Data

   Haoting Zhang, Donglin Zhan, Yunduan Lin, Jinghai He, Qing Zhu, Zuo-Jun Max Shen, and Zeyu Zheng

   Submitted to Journal of Operations Management

   2023

2022

1. Nonprogressive Diffusion on Social Networks: Approximation and Applications

   Yunduan Lin, Heng Zhang, Renyu Philip Zhang, and Zuo-Jun Max Shen

   Major Revision at Management Science

   2022

   🏆 First-Place Prize, the 13th POMS-HK International Conference Best Student Paper, 2023
   🏆 Finalist, 18th INFORMS DMDA Workshop Best Paper Competition (Theoretical Track), 2023
   🏆 Finalist, INFORMS Minority Issues Forum Poster Competition, 2023
   Accepted to INFORMS Workshop on Data Science 2023
   

   Abstract SSRN Poster

   Nonprogressive diffusion describes the dissemination of behavior on a social network, where the agents are allowed to reverse their decisions as time evolves. It has a wide variety of applications in service adoption, opinion formation, epidemiology, etc. Building upon the rich studies in network diffusion analysis and operations research, we propose a general model to characterize nonprogressive diffusion and develop a fixed-point approximation (FPA) scheme to characterize the limiting adoption on a social network. This approximation scheme admits both a theoretical guarantee and computational efficiency. We show that the maximal deviation of the FPA scheme diminishes as the network size and density increase at a rate of O(1/√N_min), where N_min is the minimum indegree of the agents on a social network. Thus, the FPA scheme is most powerful for dense and large networks that are generally prohibitive by simulation. Taking the widely studied influence maximization and pricing problems on a social network as examples, we further illustrate the broad applications of our FPA scheme. Finally, we conduct comprehensive numerical studies with synthetic and real-world networks. The FPA scheme shows 1,000 times speed up in computation time than simulation. It achieves small approximation error, and outperforms conventional algorithms even when the social network is small and/or sparse.

2020

1. Real-time Traffic Accidents Post-impact Prediction: Based on Crowdsourcing Data

   Yunduan Lin, and Ruimin Li

   Accident Analysis & Prevention 2020

   doi
2. Collimatorless Scintigraphy for Imaging Extremely Low Activity Targeted Alpha Therapy (TAT) with Weighted Robust Least Squares (WRLS)

   Yifan Zheng, Yoonsuk Huh, Qianqian Su, Jiaming Wang, Yunduan Lin, Kai Vetter, and Youngho Seo

   In International Conference on Medical Image Computing and Computer-Assisted Intervention (MICCAI) 2020

   doi

2023

1. Learning User Behavior in a Social Network: Calibration and Generalization

   Yunduan Lin, Haoting Zhang, Zeyu Zheng, and Zuo-Jun Max Shen

   In prepration, target at Management Science

   2023
2. Inventory Management of Livestream E-commerce with Social Network Information

   Yunduan Lin, and Zuo-Jun Max Shen

   Work in progress

   2023
3. The Value of Public Health Awareness in Organic Farming

   Lingfei Zhong, Yunduan Lin, and Zuo-Jun Max Shen

   Work in progress

   2023