|
|
Invited Speakers
Michal Feldman Prophet and Secretary Online Algorithms for Graph Matching (click for abstract and slides) Michal is a Professor of Computer Science at the Blavatnik School of Computer Science at Tel-Aviv University and Chair of Computation and Economics. Her research interests lie in the border of computer science, game theory and economics. She studies the design and analysis of algorithms, auctions, markers contracts and networks, under different types of uncertainty, with an emphasis on efficiency, simplicity, robustness and fairness. Ola Svensson Polyhedral Techniques in Combinatorial Optimization (click for abstract) Ola is an Associate Professor active in the theory group at the School of Computer and Communication Sciences, EPFL. His research interests include approximation algorithms, combinatorial optimization, computational complexity and scheduling. He reveived an ERC Starting Grant "OptApprox" (2014-2019) and an SNF grant "Randomness in Problem Instances and Randomized Algorithms" (2019 - 2023). Neil Walton Stability Properties of Proportional fairness and the MaxWeight Policy (click for abstract) Neil is a reader at the University of Manchester's Department of Mathematics. H received his undergraduate ('05), Masters ('06) and PhD ('10) in Mathematics at the University of Cambridge. His research is in applied probability and principally concerns the decentralized minimization of congestion in networks. He was a lecturer at University of Amsterdam where he held an NWO Veni Fellowship. He then moved to the University of Manchester where he is a Reader in Mathematics. Neil has conducted research visits at Microsoft Research Cambridge, the Basque Centre for Mathematics and the Automatic Control Laboratory ETH Zurich. Neil is a Fellow of the Alan Turing Institute. Here he is co-investigator on the project “Artificial Intelligence for Transport Planners”. He is an associate editor at the journals Operations Research and Operations Research Letters. He has won best papers awards at the ACM Sigmetrics conference and he was awarded the 2018 Erlang Prize by the Informs Applied Probability Society. From 2017 to 2019 Neil was the head of probability and statistics group at the University of Manchester. Katya Scheinberg Stochastic Oracles and Where to Find Them (click for abstract) Katya is a Professor of Operations Research and Information Engineering at Cornell University. She joined Cornell's School of Operations Research and Information Engineering faculty in July 2019. She joined the ORIE faculty after serving as the Harvey E. Wagner Endowed Chair Professor at the Department of Industrial and Systems Engineering at Lehigh University. She was also a co-director of Lehigh Institute on Data, Intelligent Systems and Computation. She was born in Moscow, Russia, and earned her undergraduate degree in operations research from the Lomonosov Moscow State University in 1992 and then received her Ph.D. in operations research from Columbia in 1997. She was a research staff member at the IBM T.J. Watson Research Center for over a decade, where she worked on various applied and theoretical problems in optimization. Her main research areas are related to developing practical algorithms and their theoretical analysis for various problems in continuous optimization, such as convex optimization, derivative free optimization, machine learning, quadratic programming, etc. She published a book in 2009 titled, Introduction to Derivative Free Optimization, which is co-authored with Andrew R. Conn and Luis N. Vicente. Recently some of her research focuses on the analysis of probabilistic methods and stochastic optimization with a variety of applications in machine learning and reinforcement learning. |
