Learning optimal admission control in partially observable queueing networks
type: Item
instance of: scholarly article
title: Learning optimal admission control in partially observable queueing networks
author: Jonatha Anselmi
author: Bruno Gaujal
author: Louis-Sébastien Rebuffi
published in: Queueing Systems
publication date: 2024-10-24T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 93E20
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7931023
zbMATH Keywords: product-form queueing networks
zbMATH Keywords: Norton's theorem
zbMATH Keywords: admission control
zbMATH Keywords: reinforcement learning
MaRDI profile type: Publication
cites work: Near-optimal regret bounds for reinforcement learning
cites work: The Complexity of Markov Decision Processes
cites work: On the Computational Complexity of Stochastic Controller Optimization in POMDPs
cites work: THE OPTIMAL ADMISSION THRESHOLD IN OBSERVABLE QUEUES WITH STATE DEPENDENT PRICING
cites work: Event-based optimization of admission control in open queueing networks
cites work: Parametric Analysis of Queuing Networks
cites work: Estimating Multiclass Service Demand Distributions Using Markovian Arrival Processes
cites work: Q3218851
cites work: Efficiency of simulation in monotone hyper-stable queueing networks
cites work: A generalisation of Norton's theorem for multiclass queueing networks
cites work: Uniform Stability of Markov Chains
DOI: 10.1007/S11134-024-09917-Y
description: scientific article; zbMATH DE number 7931023