Operations Research Scientist
Computational Engineering Division, LLNL

Andrew Mastin is a Research Scientist in the Operations Research and Systems Analysis Group. His research interests span topics relevant to both computer science and operations research, including robust optimization, approximation algorithms, Markov decision processes, random graphs, and game theory.

Ph.D., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 2015

M.S., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, 2009

B.S., Electrical Engineering, University of Arizona, AZ, 2007

• Mastin, A., P. Jaillet, and S. Chin. "Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty." International Symposium on Algorithms and Computation, 2015. [arXiv:1401.7043]

• Mastin, A. and P. Jaillet. "Greedy Online Bipartite Matching on Random Graphs." Working paper, 2013. [arXiv:1307.2536]

• Mastin, A. and P. Jaillet. "Average-Case Performance of Rollout Algorithms for Knapsack Problems." Journal of Optimization Theory and Applications, 2013. [arXiv:1301.4529]

• Mastin, A. and P. Jaillet. "Log-Quadratic Bounds for the Gaussian Q-function." Working paper, 2013. [arXiv:1304.2488]

• Mastin, A. and P. Jaillet. "Loss Bounds for Uncertain Transition Probabilities in Markov Decision Processes." IEEE Conference on Decision and Control, 2012.

• Mastin, A., J. Kepner, and J.W. {Fisher III}. "Automatic Registration of Lidar and Optical Images of Urban Scenes." IEEE Conference on Computer Vision and Pattern Recognition, 2009.