Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph'

Loïc Jean, Pascal Moyal

In this paper, we address the optimal control of stochastic matching models on general graphs and single arrivals having fixed arrival rates, as introduced in \cite{MaiMoy16}. On t…