本周日（10月10日）晚上19:30，六教6B201，李博洋、赵梓硕同学会分享自己的工作，时长约为一到两小时。
李博洋：More Communication Lower Bounds for Information-Theoretic MPC
李博洋是姚班2016级（计科60）毕业生，现工作于量化交易公司Jane Street，本次seminar他将介绍他本科期间在多方安全计算通讯复杂度下界方面的工作。他还会在Q&A环节分享他在Jane Street的工作体验。
Secure Multi-Party Computation (MPC) is a modern and important field in the studies of cryptography. In this talk, instead of introducing a better protocol, he proposes and proves a general lower bound for communication complexities as a function of properties of the function “f” for a general and important class of functions where n parties with a passively corrupted minority compute a function y_i=b_i*f_i([x_1,x_2,…,x_n]) where f_i is any function.
赵梓硕：Dynamic Car Dispatching and Pricing: Revenue and Fariness for Ridesharing
赵梓硕是姚班2015级（计科50）毕业生，现为UIUC博士生。本次seminar他将介绍他在共享单车平台设计方面的研究。
A major challenge for ridesharing platforms is to guarantee profit and fairness simultaneously, especially in the presence of misaligned incentives of drivers and riders. We focus on the dispatching-pricing problem to maximize the total revenue while keeping both drivers and riders satisfied. We study the computational complexity of the problem, provide a novel two-phased pricing solution with revenue and fairness guarantees, and develop a dynamic (a.k.a., learning-while-doing) algorithm that actively collects data to learn the demand distribution during the scheduling process. We also conduct extensive experiments to demonstrate the effectiveness of our algorithms.
Make IIIS Great Again!
