YoVDO

Limitations of Stochastic Selection with Pairwise Independent Priors

Offered By: Google TechTalks via YouTube

Tags

Stochastic Optimization Courses Combinatorial Optimization Courses Finite Fields Courses Matroid Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Introduction to Galois Theory
Higher School of Economics via Coursera
Galois Theory
NPTEL via Swayam
Introduction To Rings And Fields
Chennai Mathematical Institute via Swayam
Algebra - II
IMSC via Swayam
Coding Theory
NPTEL via YouTube