Online linear optimization over permutations

DOI10.1007/978-3-642-25591-5_55zbMATH Open1350.68291OpenAlexW30074706MaRDI QIDQ3104653FDOQ3104653

Authors: Shota Yasutake, Kohei Hatano, Shuji Kijima, Masayuki Takeda, Eiji Takimoto 

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/1524320

Recommendations

• Bandit online optimization over the permutahedron
• Bandit online optimization over the permutahedron
• Learning permutations with exponential weights
• Learning Permutations with Exponential Weights
• Efficient online linear optimization with approximation algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Linear programming (90C05)

Cited In (14)

• Learning permutations with exponential weights
• Bandit online optimization over the permutahedron
• Title not available (Why is that?)
• Efficient online linear optimization with approximation algorithms
• Optimal mechanism design for a sequencing problem with two-dimensional types
• Title not available (Why is that?)
• Linear programming with online learning
• Weighted network search games with multiple hidden objects and multiple search teams
• Combinatorial online prediction via metarounding
• Bandit online optimization over the permutahedron
• Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
• Online Linear Optimization for Job Scheduling Under Precedence Constraints
• Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
• Decomposition algorithm for the single machine scheduling polytope

This page was built for publication: Online linear optimization over permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104653)