The introductory meeting, in which the topics will be assigned, will take place on April 25 at 10:45. Students interested in the seminar are expected to attend the introductory meeting.

Preliminary list of relevant papers:

• Moshe Babaioff et al.: Secretary Problems: Weights and Discounts
• Michal Feldman et al.: Combinatorial Auctions via Posted Prices
• Tengyu Ma et al.: The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
• Anupam Gupta and Marco Molinaro: How Experts Can Solve LPs Online
• Sanjoy Dasgupta: A cost function for similarity-based hierarchical clustering
• Sanjoy Dasgupta and Philip M. Long: Performance guarantees for hierarchical clustering
• Liberty et al.: An Algorithm for Online K-Means Clustering