Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

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

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read More Add to Saved list
  • Additional Information
    • Contributors:
      Institut Élie Cartan de Lorraine (IECL); Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS); Processus aléatoires spatio-temporels et leurs applications (PASTA); Centre Inria de l'Université de Lorraine; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Élie Cartan de Lorraine (IECL); Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS); ANR-18-CE40-0019,MATCHES,Architectures d'appariement pour connecter des éléments hétérogènes et des systèmes de santé efficients.(2018)
    • Publication Information:
      CCSD
    • Publication Date:
      2023
    • Collection:
      Université de Lorraine: HAL
    • Abstract:
      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 [12]. On the 'N-shaped' graph, by following the dynamic programming approach of [5], we show that a 'Threshold'-type policy on the diagonal edge, with priority to the extreme edges, is optimal for the discounted cost problem and linear holding costs.
    • Online Access:
      https://hal.science/hal-04434805
      https://hal.science/hal-04434805v1/document
      https://hal.science/hal-04434805v1/file/Ngraph_JM3.pdf
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • Accession Number:
      edsbas.36FB0390