Improved algorithms for online load balancing

DOI10.1007/978-3-030-67731-2_15zbMath1490.68302arXiv2007.07515OpenAlexW3087469585MaRDI QIDQ831807

Eiji Takimoto, Kohei Hatano, Yaxiong Liu

Publication date: 24 March 2022

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

zbMATH Keywords

makespanonline learningsecond-order cone programmingonline load balancingBlackwell approachability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multistage and repeated games (91A20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Exponentiated gradient versus gradient descent for linear predictors
• An analog of the minimax theorem for vector payoffs
• On-line load balancing made simple: greedy strikes back
• Applications of second-order cone programming
• Online Learning and Online Convex Optimization
• Online and Random-order Load Balancing Simultaneously
• Online load balancing of temporary tasks

This page was built for publication: Improved algorithms for online load balancing