Session 8C - Stochastic Matching with Few Queries: (1-epsilon) Approximation

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Solves stochastic matching with few queries and near-optimal approximation ratio. Presents an algorithmic result combining matching theory with limited information access.

A 24-minute video from Association for Computing Machinery (ACM): “Session 8C - Stochastic Matching with Few Queries: (1-epsilon) Approximation”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020