Limitations of Stochastic Selection with Pairwise Independent Priors
Offered By: Google TechTalks via YouTube
Course Description
Overview
Explore the limitations of stochastic selection problems with pairwise-independent priors and matroid constraints in this Google TechTalk presented by Neel Patel. Delve into the essentially-optimal bounds for contention resolution and prophet inequalities, examining both negative results for general matroids and positive outcomes for matroids with the partition property. Learn about the construction of pairwise-independent distributions and their impact on balanced offline CRS and competitive prophet inequalities. Discover how random linear maps transform linear independence into stochastic independence, and understand the implications for combinatorial optimization under uncertainty. Gain insights into the speaker's research interests, including algorithmic contract theory, computational economics, and dynamic algorithms for graph problems.
Syllabus
Limitations of Stochastic Selection with Pairwise Independent Priors
Taught by
Google TechTalks
Related Courses
Matroid Tautological Classes in Types A and BFields Institute via YouTube The Geometry of Geometries - Matroid Theory, Old and New
International Mathematical Union via YouTube Linear Matroid Matching in the Oracle Model
Hausdorff Center for Mathematics via YouTube Faster Matroid Intersection - Winter 2020 Theory Seminar
Paul G. Allen School via YouTube Correlation Inequalities for Schur Functions and Young Tableaux
Institute for Pure & Applied Mathematics (IPAM) via YouTube