The Polynomial Paradigm in Algorithms

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


Duration: 56:13
978 views
15

Shayan Oveis Gharan (University of Washington) and Nikhil Srivastava (UC Berkeley)
Simons Institute Open Lectures, Spring 2019
https://simons.berkeley.edu/events/openlectures2019-spring-1



Other Videos By Simons Institute for the Theory of Computing


2019-09-18Incentivizing Exploration among Behavioral Agents with Unbiased Histories
2019-09-18Stochastic Matching with Few Queries
2019-09-17Facilitating the Search for Partners on Matching Platforms
2019-09-17Ratings Design and Barriers to Entry
2019-09-17Consumer Protection in an Online World: An Analysis of Occupational Licensing
2019-09-17Marketplaces and Product Quality
2019-09-17The Economics of the Bitcoin Payment System
2019-09-16TBD
2019-09-16Computational Complexity of Matching in Ride Sharing
2019-09-10Algorithmic Opportunities in Matching Markets
2019-09-10The Polynomial Paradigm in Algorithms
2019-09-10Randomness in Number Theory
2019-09-06Design of Lotteries and Waitlists for Affordable Housing Allocation
2019-09-06Dynamically Stable Matching
2019-09-06On Matching and Thickness in Heterogeneous Dynamic Markets
2019-09-06Faira, an application of Game Theory in Real Estate
2019-09-06The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Worst-Case Guarantee...
2019-09-06Online Matching for Ride-sharing
2019-09-05Fairness and Efficiency for Probabilistic Allocations with Endowments
2019-09-05Information Acquisition Costs in Matching Markets
2019-09-05Job Matching under Constraints


Tags:
Simons Institute
theoretical computer science
UC Berkeley
open lecture