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

arXiv2402.01803MaRDI QIDQ6520139FDOQ6520139

Authors: Loïc Jean, Pascal Moyal 

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

This page was built for publication: Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph'

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6520139)