Approximate Optimality with Bounded Regret in Dynamic Matching Models

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


Duration: 45:10
317 views
2

Ana Bušić, INRIA and École Normale Supérieure Paris
Real-Time Decision Making
https://simons.berkeley.edu/talks/ana-busic-2016-07-01



Other Videos By Simons Institute for the Theory of Computing


2016-08-23Online Scheduling Meets Queueing II
2016-08-23Online Scheduling Meets Queueing I
2016-08-23Competitive Analysis of Online Algorithms II
2016-08-23Competitive Analysis of Online Algorithms I
2016-08-22Sequential Decision Making: Prophets and Secretaries II
2016-08-22Sequential Decision Making: Prophets and Secretaries I
2016-08-22Approximation Algorithms for Stochastic Optimization II
2016-08-22Approximation Algorithms for Stochastic Optimization I
2016-07-01Localization and Nonmetric Multidimensional Scaling via Paired Comparisons
2016-07-01New Algorithms for Heavy Hitters in Data Streams
2016-07-01Approximate Optimality with Bounded Regret in Dynamic Matching Models
2016-07-01Predicting from Noisy and Incomplete Data: Some Perspectives from Computational Learning Theory
2016-07-01Real-Time Decision Making in Hybrid Systems
2016-07-01When Computing Time is Time Lost
2016-06-30Distributed Control for Demand Dispatch
2016-06-30Algorithmic Aspects of Online Advertising
2016-06-30Dynamic Pricing in Ridesharing Platforms
2016-06-30Smarter Tools for (Citi)Bike-Sharing
2016-06-30Optimal Power Flow: Relaxation, Online Algorithm, Fast Dynamics
2016-06-29Sub-Quadratic Recovery of Correlated Pairs
2016-06-29Seeing Real-Time Traffic Problems


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Ana Bušić
Real-Time Decision Making