CS Peer Talk | Sample-Based Matroid Prophet Inequalities

第四十期

报告人：Jinzhao Wu, Yale University

时间：3月25日（星期一）2:00pm

地点：静园五院204

Host：陈炤桦，图灵班2017级

报告信息

Title

Sample-Based Matroid Prophet Inequalities

Abstract

We study matroid prophet inequalities when distributions are unknown and accessible only through samples. While single-sample prophet inequalities for special matroids are known, no constant-factor competitive algorithm with even a sublinear number of samples was known for general matroids. Adding more to the stake, the single-sample version of the question for general matroids has close (two-way) connections with the long-standing matroid secretary conjecture.

Four years ago, we developed an algorithm to address the matroid prophet inequalities problem using  samples. Unfortunately, this algorithm was shown to be incorrect. In this work, we finally are able to give a  -competitive matroid prophet inequality with only  samples. Our algorithm consists of two parts: (i) a novel quantile-based reduction from matroid prophet inequalities to online contention resolution schemes (OCRSs) with  samples, and (ii) a  -selectable matroid OCRS with   samples which carefully addresses an adaptivity challenge.

Biography

Jinzhao Wu is a second-year Ph.D. student in Computer Science at Yale University, where he is advised by Prof. Yang Cai. He has a broad interest in theoretical computer science, with a particular focus on algorithmic game theory and computational problems arising from the field of economics.

about CS Peer Talk

作为活动的发起人，我们来自北京大学图灵班科研活动委员会，主要由图灵班各年级同学组成。我们希望搭建一个CS同学交流的平台，促进同学间的交流合作，帮助同学练习展示，同时增进友谊。

目前在计划中的系列包括但不限于：

• 教程系列：学生讲者为主，介绍自己的研究领域

• 研究系列：学生讲者为主，介绍自己的研究成果

• 客座系列：邀请老师做主题报告

除非报告人特别要求，报告默认是非公开的，希望营造一个自由放松但又互相激励的交流氛围。

主讲嘉宾招募

如果你愿意和大家分享你的学术成果、经历经验，总结回顾、触发新思，欢迎报名自荐。

主讲人报名：发邮件至 cs_research_tc@163.com，写明想讲的题目、内容及时间。

北京大学图灵班科研活动委员会

—   版权声明  —

本微信公众号所有内容，由北京大学前沿计算研究中心微信自身创作、收集的文字、图片和音视频资料，版权属北京大学前沿计算研究中心微信所有；从公开渠道收集、整理及授权转载的文字、图片和音视频资料，版权属原作者。本公众号内容原作者如不愿意在本号刊登内容，请及时通知本号，予以删除。