scientific article; zbMATH DE number 6982972

zbMath1473.62017arXiv1704.07943MaRDI QIDQ4558552

No author found.

Publication date: 22 November 2018

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

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

zbMATH Keywords

bipartite graphregret boundsmulti-armed banditsside observations

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Applications of statistics to social sciences (62P25) Applications of graph theory (05C90) General considerations in statistical decision theory (62C05)

Related Items (1)

Robust sequential design for piecewise-stationary multi-armed bandit problem in the presence of outliers

Uses Software

• Graclus

Cites Work

• UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
• Asymptotically efficient adaptive allocation rules
• Linearly Parameterized Bandits
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Lower Bounds and Algorithms for Dominating Sets in Web Graphs
• Finite-time analysis of the multiarmed bandit problem
• Unnamed Item

This page was built for publication: