<thead id="r2s8r"></thead>

<mark id="r2s8r"><u id="r2s8r"></u></mark>
<tt id="r2s8r"><button id="r2s8r"><td id="r2s8r"></td></button></tt>
<listing id="r2s8r"></listing>
<label id="r2s8r"></label>
  • 新聞中心NEWS


    講座:Promotion Design with Path Dependent Network Effects

    發布者:人力資源辦公室    發布時間:2020-12-07

    題 目:Promotion Design with Path Dependent Network Effects

    演講人:畢晟       博士生        新加坡國立大學

    主持人:李成璋    助理教授    上海交通大學安泰經濟與管理學院

    時 間:2020年12月24日(周四)9:00-10:30



    The limited-time “collect and win” games are often used to promote products and drive sales to the retail outlets by creating short term temporal changes to customers' purchasing behavior -- the desire to buy products on promotion and frequency of purchases both increase with the number of previous purchases. We study the promotion design problem for these games, to determine the set of eligible products and the duration of the promotion. The customers' purchasing behavior depends not only on the product attributes and features (static effect), but also on product eligibility for promotion and historical purchases (path dependent network effect). We model the dynamic choice processes using poissonization of the Polya Urn models, to capture the transient change in the frequency of purchases and purchase probability of each product on promotion. We use this approach to study the optimal promotion design problem under different “collect and win” game settings, by solving non-convex assortment optimization problems. We obtain an exact and/or approximation approach for these problems, and show that the revenue-ordered promotion set is already near-optimal in many of these games. The optimal duration depends on the promotion set chosen, and also on the targeted number of products sold before the game found a winner for the grand prize. Using a set of data provided by a fast-food company, we show the importance of carefully choosing the promotion set and promotion duration, both decisions that will affect the total revenues and profits generated by such promotion campaigns. 


    Sheng Bi is a fifth-year Ph.D. candidate in the Department of Analytics and Operations at National University of Singapore, advised by Professor Chung Piaw Teo and Long He. Prior to this, she received a Bachelor’s degree in Industrial Engineering from Nanjing University. Her research interests are in the area of data-driven optimization, customer choice modeling, revenue and supply chain management.