Date: 2020/01/13 (Mon) 10:20 -- 01/14 (Tue) 17:00
Location: Kyoto University, Research Institute for Mathematical Sciences (RIMS), Room 420
[January 13]
10:20--10:30 (Opening)
10:30--11:40 Haris Aziz (UNSW Sydney)
"Fair and efficient allocation of indivisible goods and chores"
11:40--13:40 (Lunch Break)
13:40--14:50 Naouki Kamiyama (Kyushu University)
"Matching problems under preferences with ties and matroid constraints"
15:00--16:10 Kristóf Bérczi (Eötvös Loránd University)
"Supermodularity in unweighted graph optimization"
16:10--16:30 (Coffee Break)
16:30--17:40 Chandra Chekuri (University of Illinois, Urbana-Champaign)
"Parallel algorithms for submodular function maximization"
19:00--21:00 (Banquet)
[January 14]
9:30--10:40 Telikepalli Kavitha (Tata Institute of Fundamental Research)
"Popular matchings: Good, bad, and mixed"
10:50--12:00 Endre Boros (Rutgers University)
"Two-person zero-sum stochastic mean payoff games"
12:00--14:00 (Lunch Break)
14:00--15:10 Yusuke Kobayashi (Kyoto University)
"Restricted 2-matching problems"
15:10--15:30 (Coffee Break)
15:30--16:40 Euiwoong Lee (New York University)
"The number of minimum k-cuts: Improving the Karger-Stein bound"
16:40--17:00 (Closing)
[Banquet]