BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IORA - Institute of Operations Research and Analytics - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IORA - Institute of Operations Research and Analytics
X-ORIGINAL-URL:https://iora.nus.edu.sg
X-WR-CALDESC:Events for IORA - Institute of Operations Research and Analytics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:+08
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20250829T100000
DTEND;TZID=Asia/Singapore:20250829T113000
DTSTAMP:20260412T190746
CREATED:20250821T021303Z
LAST-MODIFIED:20250821T021303Z
UID:26990-1756461600-1756467000@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series: Sean Zhou
DESCRIPTION:Name of Speaker\nSean Zhou\n\n\nSchedule\n29 August 2025\, 10am – 11.30am\n\n\nVenue \nHSS 4 – 7 (Hon Sui Sen Memorial Library\, level 4 Seminar Room)\n\n\nLink to Register \n \nhttps://nus-sg.zoom.us/meeting/register/HB2NQ5ZjRpuRwFiBsxDOxg\n\n\nTitle\nLearning and Pricing for Consumer Electronics Trade-in Program\n\n\nAbstract\nWe consider a dynamic pricing problem for a two-sided consumer electronics trade-in program\, where a firm acquires and re-sells multiple types of pre-owned (used) products over a finite selling horizon. There are customers trading in their used products for new products at discounted prices and customers buying refurbished products. The firm sets trade-in prices and resale prices to maximize its total expected profit. We first discuss the scenario that the firm knows the choice models of customers. Due to the high-dimensional state space\, deriving the optimal policy using dynamic programming is computationally intractable. To circumvent this\, we develop simple and provably effective heuristic policies based on the solution to a deterministic upper-bound problem. We design a dynamic policy called the Batched-Adjustment Control (BAC) policy\, under which the selling horizon is divided into different consecutive and disjoint batches for different products and the prices in one batch are updated based on the realized uncertainties in the previous batch. The profit loss of BAC relative to the optimal one is in the order of  . When the firm does not know the choice model parameters of customers\, it has to learn while making pricing decisions over time. We develop an algorithm called Parametric-Batched-Adjustment Control (PBAC)\, in which the firm first uses Maximum Likelihood Estimation to learn the trade-in and demand models’ parameters\, and then adopt a similar pricing policy akin to BAC while using the estimated parameters. With carefully chosen algorithm parameters (e.g.\, length of exploration phase\, batch size)\, we show that PBAC has a regret in the order of  . This is based on joint work with Zhuoluo Zhang (Xiamen University)\, Murray Lei (Queen’s University)\, and Wenhao Li (SUFE).\n\n\nAbout the Speaker\nSean Zhou is Professor and Chair of Department of Decisions\, Operations and Technology\, CUHK Business School\, and Professor in Department of Systems Engineering and Engineering Management (by courtesy)\, at The Chinese University of Hong Kong (CUHK). He has held visiting positions at National University of Singapore and University of Toronto. He received his Ph.D. in Operations Research from North Carolina State University. His main research interests are inventory management\, pricing\, sustainable operations\, data-driven supply chain optimization\, and operations and marketing interface. He serves as Area Editor (Inventory and Supply Chain Optimization) of OR Letters and Associate Editor of various journals including Naval Research Logistics and Service Science.
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-sean-zhou/
CATEGORIES:IORA Seminar Series
END:VEVENT
END:VCALENDAR