Two queues with non-stochastic arrivals

DOI10.1016/j.orl.2013.11.008zbMath1408.90098OpenAlexW2153597686MaRDI QIDQ1667172

N. S. Walton

Publication date: 27 August 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.11.008

zbMATH Keywords

space-filling curveregret minimizationnon-stochastic queueing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• On the greedy walk problem
• An analog of the minimax theorem for vector payoffs
• Logarithmic regret algorithms for online convex optimization
• The weighted majority algorithm
• Adversarial queuing theory
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Adaptive Routing on the Plane
• Using fluid models to prove stability of adversarial queueing networks
• The Nonstochastic Multiarmed Bandit Problem
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Prediction, Learning, and Games

This page was built for publication: Two queues with non-stochastic arrivals