Combinatorial bandits
type: Item
instance of: scholarly article
title: Combinatorial bandits
zbMATH Open document ID: 1262.91052
author: Nicolò Cesa-Bianchi
author: Gábor Lugosi
published in: Journal of Computer and System Sciences
publication date: 2012-08-17T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 62M20
zbMATH DE Number: 6067738
zbMATH Keywords: online prediction
zbMATH Keywords: adversarial bandit problems
zbMATH Keywords: online linear optimization
MaRDI profile type: Publication
full work available at URL: j.jcss.2012.01.001
OpenAlex ID: W2914156981
Wikidata QID: Q59538560
cites work: Prediction, Learning, and Games
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Adaptive routing with end-to-end feedback
cites work: Learning Theory
cites work: Robbing the bandit
cites work: Q3174159
cites work: 10.1162/1532443041424328
cites work: Efficient algorithms for online decision problems
cites work: Q4821526
cites work: Learning Permutations with Exponential Weights
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
cites work: Probability on trees and networks
cites work: Q3706275
cites work: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
cites work: Q4252430
cites work: Polynomial-Time Approximation Algorithms for the Ising Model
DOI: 10.1016/J.JCSS.2012.01.001
description: scientific article; zbMATH DE number 6067738