Online metric allocation and time-varying regularization

<p>We introduce a general online allocation problem that connects several of the most fundamental problems in online optimization. Let 𝑀 be an 𝑛-point metric space. Consider a resource that can be allocated in arbitrary fractions to the points of 𝑀. At each time 𝑡, a convex monotone cost funct...

Полное описание

Библиографические подробности
Главные авторы: Bansal, N, Coester, C
Формат: Conference item
Язык:English
Опубликовано: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2022
Предметы: