Recommendations
Cites work
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 1305538 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- 10.1162/1532443041424328
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
- Efficient algorithms for online decision problems
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Learning Permutations with Exponential Weights
- Learning Theory
- Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
- Polynomial-Time Approximation Algorithms for the Ising Model
- Prediction, Learning, and Games
- Probability on trees and networks
- Robbing the bandit
- The Nonstochastic Multiarmed Bandit Problem
- The on-line shortest path problem under partial monitoring
Cited in
(41)- Online learning in budget-constrained dynamic Colonel Blotto games
- Adaptive policies for perimeter surveillance problems
- Combining initial segments of lists
- Algorithms for adversarial bandit problems with multiple plays
- Order scoring, bandit learning and order cancellations
- scientific article; zbMATH DE number 6253908 (Why is no real title available?)
- Sequential decision making with vector outcomes
- Batched bandit problems
- Negatively Correlated Bandits
- Online team formation under different synergies
- Combinatorial online prediction via metarounding
- Online learning of energy consumption for navigation of electric vehicles
- Online learning over a finite action set with limited switching
- Regret bounds and minimax policies under partial monitoring
- Learning in combinatorial optimization: what and how to explore
- Regret in online combinatorial optimization
- Bandit online optimization over the permutahedron
- Online prediction problems with variation
- Multi-channel transmission scheduling with hopping scheme under uncertain channel states
- Learning Theory
- A penalized bandit algorithm
- Bandit regret scaling with the effective loss range
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- Variable Selection Via Thompson Sampling
- Bounded Regret for Finitely Parameterized Multi-Armed Bandits
- Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback
- A combinatorial metrical task system problem under the uniform metric
- Sequential Shortest Path Interdiction with Incomplete Information
- Asymptotically optimal algorithms for budgeted multiple play bandits
- Online learning of network bottlenecks via minimax paths
- Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
- Bandit online optimization over the permutahedron
- scientific article; zbMATH DE number 7370524 (Why is no real title available?)
- Learning unknown service rates in queues: a multiarmed bandit approach
- A combinatorial multi-armed bandit approach to correlation clustering
- Multi-armed bandits with censored consumption of resources
- Per-round knapsack-constrained linear submodular bandits
- An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
- Importance weighting without importance weights: an efficient algorithm for combinatorial semi-bandits
This page was built for publication: Combinatorial bandits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439986)
