Invited Speakers

Address
Cornell University
Operations Research and Information Engineering (ORIE)
Room 230 Rhodes Hall, 136 Hoy Road, Ithaca, NY, USA
dag369 "at" cornell dot edu

Lectures
Beating the curse of dimensionality in options pricing and optimal stopping
Simple and explicit bounds for multi-server queues with universal 1/(1-p) (and better) scaling

Short Bio
David A. Goldberg is an Associate Professor in Cornell's ORIE department. Previously, he was the A. Russell Chandler III Associate Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. He received his Ph.D. in Operations Research at MIT in 2011, and his B.S. in Computer Science (minors in Operations Research and Applied Math) from Columbia University in 2006. Goldberg's research is in applied probability, on topics including optimal stopping and options pricing, inventory and queueing models, combinatorial optimization, robust optimization, and multi-arm bandits. His work has been recognized with accolades including an NSF CAREER award, 2015 Nicholson Competition first place, 2015 JFIG Competition second place, and 2014 MSOM and 2010 Nicholson Competitions finalist. He is also an associate editor for the journals Operations Research and Queueing Systems.

Address
Etcheverry Hall, University of California
Berkeley, CA 94720, USA
hochbaum at ieor.berkeley.edu

Lectures
Recognizing polynomial time solvable integer programs and a general purpose technique for approximation algorithms
Combinatorial optimization for image segmentation and large scale data mining

Short Bio
Dorit S. Hochbaum is a full professor and Chancellor chair at UC Berkeley's department of Industrial Engineering and Operations Research (IEOR). She received her PhD from Wharton School of Business at the U of Pennsylvania. Her research interests are in the areas of design and analysis of computer algorithms, approximation algorithms and discrete and continuous optimization.
Professor Hochbaum is the author of over 160 papers that appeared in the Operations Research, Management Science and Theoretical Computer Science literature. Prof. Dorit S. Hochbaum was awarded an honorary doctorate of sciences by the University of Copenhagen recognizing Hochbaum's ground-breaking achievements and leadership in optimization in general and in the field of approximation algorithms for intractable problems in particular. Hochbaum was awarded the title of INFORMS fellow in fall 2005 for her extensive contributions to Operations Research, Management Science and design of algorithms. She is the winner of the 2011 INFORMS Computing Society prize for best paper dealing with the Operations Research/Computer Science interface. Professor Hochbaum is a fellow of the Society of Industrial and Applied Mathematics (SIAM) since 2014.

Address
University of Glasgow
East Quad, South Flagpole, Room 340-D
University Avenue, Glasgow G12 8QQ, UK
Herve.Moulin@glasgow.ac.uk

Lectures
Mechanism design for Fair Division
Fair Division on the Internet

Short Bio
Hervé Moulin graduated in 1971 from the Ecole Normale Superieure in Paris, and received his Ph.D. in mathematics from the Université de Paris in 1975. He has taught at the Ecole Nationale de la Statistique et Administration Economique, University of Paris at Dauphine, Virginia Polytechnic Institute and State University, Duke University and Rice University. He is currently D. J. Robertson Chair in Economics at the University of Glasgow. He is a Fellow of the Econometric Society since 1983, of the Royal Society of Edinburgh since 2015, and of the British Academy since 2018. He is currently the President of the Game Theory Society. His research has been supported in part by seven NSF grants. He has written five books and over 100 peer-reviewed articles. He is an Associate Editor of Games and Economic Behavior, Mathematics of Operations Research, Transactions in Economics and Computations, and a Co-Editor of Economic Theory.
His work has contributed to redefining the field of 'normative economics', by borrowing concepts and techniques from social choice, implementation, and game theories. The goal is to invent new mechanisms --or justify existing ones-- in a variety of resource allocation problems. Examples include voting by successive veto, generalized median voting rules; the fair division of an estate (as in a divorce or inheritance); rationing of over-demanded commodities (such as organs for transplant or seats for a popular event); the exploitation of a "commons", i.e., a technology producing a public good, an excludable public good, or private goods; the assignment of tasks between workers; the scheduling of jobs in a queue; sharing the cost and pricing the traffic of a communication network, etc..
His most recent textbook, Fair Division and Collective Welfare (MIT Press 2003), introduces the broad contributions of microeconomic analysis to fair division problems.

Address
The University of Chicago, Booth School of Business
5807 South Woodlawn Avenue - Office #516
Chicago, IL 60637, USA
amy.ward@chicagobooth.edu

Lectures
Staffing, Routing, and Payment to Trade Off Speed and Quality in Large Service Systems
A Fluid Limit for an Overloaded Multi-class Many Server Queue with General Reneging Distribution

Short Bio

Amy R. Ward is the Rothman Family Professor of Operations Management and William S. Fishman Faculty Scholar at the University of Chicago Booth School of Business. She received her Ph.D. from Stanford University in 2001. She recently completed her term as chair of the INFORMS Applied Probability Society (term 11/2016-11/2018). She is the Service Management Special Interest Group Chair for the INFORMS Manufacturing and Service Operations Management Society (term 6/2017-6/2019). She is the Stochastic Models co-Area Editor for the journal Operations Research.