講座名稱：Optimal 4-Approximation for the Correlated Pandora’s Problem
講座時間：2025-06-13 09:30
講座地點：清水河校區4號科研樓A區518
特邀專家：黃志毅，香港大學教授。研究结果主要在于探索不確定性下的序列決策算法（在線算法）、基于差异信息形式的學習理論（學習理論）、激勵自利主體共享私有信息的機制設計（機制設計），以及在保密某些信息的同時披露另類信息的技術（差分隱私）。
讲座内容：The Correlated Pandora’s Problem posed by Chawla et
al. (2020) generalizes the classical Pandora’s Problem by allowing the numbers
inside the Pandora’s boxes to be correlated. It also generalizes the Min Sum
Set Cover problem, and is related to the Uniform Decision Tree problem. This
paper gives an optimal 4-approximation for the Correlated Pandora’s Problem,matching
the lower bound of 4 from Min Sum Set Cover.
