The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Worst-Case Guarantee...

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


Duration: 44:22
504 views
3

Yang Cai (Yale University)
https://simons.berkeley.edu/talks/tba-122
Matching and Objectives



Other Videos By Simons Institute for the Theory of Computing


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
2019-09-05Open Problems in the Display Ads Market Place
2019-09-05A Simple Condition for Constant Regret in Online Decision-Making
2019-09-05Carpooling and the Economics of Self-Driving Cars
2019-08-30Introduction to Cryptocurrency Regulatory Policy (Part II)
2019-08-30Introduction to Cryptocurrency Regulatory Policy (Part I)
2019-08-30Rethinking Consensus in the Blockchain Setting (Part II)


Tags:
Simons Institute
theoretical computer science
UC Berkeley
theory of computing
theory of compuation
computer science
Yang Cai
Matching and Objectives