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

1 citations · 1 across the 1 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2024★ 1 cited

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…