Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...

We consider a stock cutting problem for a paper plant that produces sheets of various sizes for a finished goods inventory that services random customer demand. The controller decides when to shut ...

Disclaimer: This Working Paper should not be reported as representing the views of the IMF.The views expressed in this Working Paper are those of the author(s) and do not necessarily represent those ...