Playing games with approximation algorithms

Abstract

In an online linear optimization problem, on each period t, an online algorithm chooses st ∈ S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adversarial) chooses a weight vector wt ∈ R, and the algorithm incurs cost c(st,wt), where c is a fixed cost function that is linear in the weight vector. In the full-information… (More)
DOI: 10.1145/1250790.1250870

Topics

2 Figures and Tables

Statistics

051015'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

66 Citations

Semantic Scholar estimates that this publication has 66 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics