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 ...

Oper. Res. 40:736–749] and reduces to the well-known lower bound problem introduced in Bomberger [Bomberger EE (1966) A dynamic programming approach to a lot size scheduling problem. Management Sci.