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 ...
This is a preview. Log in through your library . Abstract In probabilistic linear programming models the decision maker is typically assumed to know the probability distribution of the random ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback