Bandit online optimization over the permutahedron

DOI10.1016/j.tcs.2016.07.033zbMath1359.90112OpenAlexW2477742853MaRDI QIDQ329616

Kohei Hatano, Nir Ailon, Eiji Takimoto

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.033

zbMATH Keywords

banditpermutationcombinatorial online predictionpermutahedron

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial bandits
• The complexity of computing the permanent
• The relationship between Luce's choice axiom, Thurstone's theory of comparative judgment, and the double exponential distribution
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Online Linear Optimization over Permutations
• Online Prediction under Submodular Constraints
• The Nonstochastic Multiarmed Bandit Problem
• Prediction, Learning, and Games

This page was built for publication: Bandit online optimization over the permutahedron