Research map / Learning theory and algorithms / Prediction and decision losses
Quantifying the Cost of Learning in Queueing Systems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Queueing Matching Bandits with Preference Feedback (NeurIPS 2024 · similarity 0.88)
- Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret (NeurIPS 2026 · similarity 0.87)
- QGym: Scalable Simulation and Benchmarking of Queuing Network Controllers (NeurIPS 2024 · similarity 0.85)
- Reinforcement Learning and Regret Bounds for Admission Control (ICML 2024 · similarity 0.85)
- Delay as Payoff in MAB (AAAI 2025 · similarity 0.85)
- Decentralized Scheduling with QoS Constraints: Achieving O(1) QoS Regret of Multi-Player Bandits (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.