scientific article; zbMATH DE number 7561642

DOI10.4230/LIPICS.ICALP.2019.149MaRDI QIDQ5092356

Shunhao Oh, Anuja Meetoo Appavoo

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1904.12355

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multi-armed banditsperiodicity in environmentwireless network selection

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• The Nonstochastic Multiarmed Bandit Problem
• Multiplicative updates outperform generic no-regret learning in congestion games
• QoE-Based Server Selection for Content Distribution Networks
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

This page was built for publication: