Matchings

Matchings

Published on ● Video Link: https://www.youtube.com/watch?v=5QNbR4DWlDQ



Duration: 1:00:54
390 views
7


Batching and Optimal Multi-stage Bipartite Allocations
Yiding Feng (Northwestern University), Rad Niazadeh (University of Chicago Booth School of Business)

Tiered Random Matching Markets: Rank is Proportional to Popularity
Itai Ashlagi (Stanford University), Mark Braverman (Princeton University), Clayton Thomas (Princeton University), Geng Zhao (Stanford University)

Randomness and Fairness in Two-Sided Matching with Limited Interviews
Hedyeh Beyhaghi (Toyota Technological Institute at Chicago), Eva Tardos (Cornell University)

Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets
Vijay Vazirani (University of California, Irvine), Mihalis Yannakakis (Columbia University)

ITCS 2021







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS 2021