My name is Peng Shi and I'm a 5th year PhD student at MIT Operations Research Center. I will be a post-doc researcher at Microsoft Research New England for one year starting July 2016, and I will be starting a tenure-track position at USC Marshall in the Data Science and Operations group in June 2017.

I am interested in developing mathematical models and techniques that can significantly benefit society. My current focus is prediction and optimization in matching markets, which include systems that match students to schools, applicants to subsidized housing, workers to jobs, and organ donors to recipients. Characteristics of these systems include heterogeneous supply and demand, potential strategic behavior of agents, and inability of obtaining the desired allocation by only setting prices. Much of my PhD work is motivated by school choice in Boston, for which I proposed an assignment plans that was adopted in March 2013 (for news coverage, see Boston Globe 2012/10/27, NY Times 2013/3/13, and NY Times 2013/3/15). I am currently working on developing theories and methodologies to assist future school choice reforms, and on applying optimization to other matching markets.

Working Papers

Assortment Planning in School Choice. (Preliminary Draft).

Demand Modeling, Forecasting, and Counterfactuals (with Parag Pathak). See here for Part I.

How Much Real Choice Do I Have in a Two-sided Matching Market? (with Itai Ashlagi, Mark Braverman, and Yash Kanoria).

Journal Publications

Optimal Allocation without Money: an Engineering Approach (with Itai Ashlagi). Management Science, Forthcoming, 2015.

Guiding School-Choice Reform through Novel Applications of Operations Research. Interfaces, 45(2), 2015.

Improving Community Cohesion in School Choice via Correlated-Lottery Implementation (with Itai Ashlagi). Operations Research , 62(6), 2014.

Approximation algorithms for restless bandit problems (with Kamesh Munagala and Sudipto Guha). Journal of the ACM (JACM) , 58(1), 2010.

Refereed Conference Proceedings

Prediction Mechanisms that Do Not Incentivize Undesirable Actions (with Vincent Conitzer and Mingyu Guo). Appeared in WINE'09.

Approximation algorithms for restless bandit problems (with Kamesh Munagala and Sudipto Guha). Appeared in SODA'09.

The Stochastic Machine Replenishment Problem (with Kamesh Munagala). Appeared in IPCO'08.


MIT Sloan School of Management:

Duke University: