Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=Ei5cR5wq-jg


Duration: 34:28
152 views
3

12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
http://itcs-conf.org/

Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility

José Correa (Universidad de Chile)
Paul Dütting (London School of Economics)
Felix Fischer (Queen Mary University of London)
Kevin Schewior (Universität zu Köln)
Bruno Ziliotto (Université Paris-Dauphine)



Other Videos By Simons Institute for the Theory of Computing


2021-01-15Buying Data Over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions
2021-01-15High-entropy dual functions and locally decodable codes
2021-01-15Randomness and Fairness in Two-Sided Matching with Limited Interviews
2021-01-15Counterexamples to the Low-Degree Conjecture
2021-01-15Majorizing Measures for the Optimizer
2021-01-15Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing
2021-01-15Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma
2021-01-15Shrinkage of Decision Lists and DNF Formulas
2021-01-15Quantitative Correlation Inequalities via Semigroup Interpolation
2021-01-15Differentially Oblivious Turing Machines
2021-01-15Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
2021-01-15Online Paging with a Vanishing Regret
2021-01-15Towards local testability for quantum coding
2021-01-15Complete Problems for Multi-Pseudodeterministic Computations
2021-01-15A New Connection Between Node and Edge Depth Robust Graphs
2021-01-15Training (Overparametrized) Neural Networks in Near-Linear Time
2021-01-15Communication memento: Memoryless communication complexity
2021-01-15Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration
2021-01-15An O(n) time algorithm for finding Hamilton cycles with high probability
2021-01-15Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets
2021-01-15Sensitivity Analysis of the Maximum Matching Problem