|LBH / Room E.08
The kick-off meeting, in which the topics will be assigned, will take place on October 26 at 10:30.
|Online Stochastic Matching: Beating 1-1/e
|Robust Randomized Matchings
|Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis
|A proof of the Boyd-Carr Conjecture
|Uncoordinated Two-Sided Matching Markets
|Approximating the k-Set Packing Problem by Local Improvements
|An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
The focus of the seminar will be on algorithmic questions related to matching problems.
Preliminary list of relevant papers: