Two queues with non-stochastic arrivals
type: Item
instance of: scholarly article
title: Two queues with non-stochastic arrivals
zbMATH Open document ID: 1408.90098
author: Neil Walton
published in: Operations Research Letters
publication date: 2018-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 6927807
zbMATH Keywords: non-stochastic queueing
zbMATH Keywords: regret minimization
zbMATH Keywords: space-filling curve
MaRDI profile type: Publication
full work available at URL: j.orl.2013.11.008
OpenAlex ID: W2153597686
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
cites work: Q5729634
cites work: A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
cites work: An analog of the minimax theorem for vector payoffs
cites work: On the greedy walk problem
cites work: Adversarial queuing theory
cites work: Prediction, Learning, and Games
cites work: Using fluid models to prove stability of adversarial queueing networks
cites work: Logarithmic regret algorithms for online convex optimization
cites work: Q5811575
cites work: The weighted majority algorithm
cites work: Adaptive Routing on the Plane
cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
DOI: 10.1016/J.ORL.2013.11.008
description: scientific article; zbMATH DE number 6927807