精品人妻一区二区色欲产成人_国产成人精品92深夜福利_亚洲精品无码老妇成人AV_蜜桃夜色精品国产噜噜亚洲AV_亚洲精品有码中文av

ENGLISH
您所在的位置: 首頁» 新聞中心» 講座預告

【明理講堂2024年第59期】10-7新加坡國立大學張俊標教授:From lotteries to optimal decision-making: Operations research and the theory of moments

報告題目:From lotteries to optimal decision-making: Operations research and the theory of moments 

時間:2024年10月7日上午10:30-12:00

地點:主樓240金融實驗室

報告人:Chung Piaw, TEO

報告人簡介:

Chung Piaw Teo(張俊標)  新加坡國立大學商學院校長特聘講座教授

Chung Piaw Teo is the Provost’s Chair Professor at the NUS Business School and concurrently serves as the Executive Director of the Institute of Operations Research and Analytics (IORA) at the National University of Singapore. He was elected Fellow of INFORMS in 2019 and was awarded the Public Administration Medal (Silver) by the Singapore Government in 2023. His research interests span service and manufacturing operations, supply chain management, discrete optimization, and machine learning. He serves as a department editor for Management Science (Optimization, now Optimization and Analytics) and is a former area editor for Operations Research (Operations and Supply Chains).

報告內(nèi)容簡介:

Lottery games, with their complex probabilistic structures and significant financial stakes, provide a fertile playground for Operations Research (O.R.) researchers. This talk explores the rich opportunities for applying advanced O.R. techniques to optimize various aspects of lottery operations, from ticket sales to payout management, and illustrates the broader implications for decision making in related fields. Through various real life case studies, we demonstrate how the study of lottery games can yield insights into human behavior, statistical anomalies, and effective risk management strategies. In particular, we show how mean-variance analysis, a core concept within the theory of moments, can be a powerful method in decision making within this sector. We also develop a general framework for the “picking winners” problem, aiming to select a small pool of candidate solutions to maximize the chances that one will perform exceedingly well in a combinatorial optimization problem, under a linear and additive random payoff function.

(承辦:管理工程系、科研與學術交流中心、中國運籌學會數(shù)據(jù)科學與運籌智能分會(籌))

TOP