Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm

Cite

Text

Geulen et al. "Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm." Annual Conference on Computational Learning Theory, 2010.

Markdown

[Geulen et al. "Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm." Annual Conference on Computational Learning Theory, 2010.](https://mlanthology.org/colt/2010/geulen2010colt-regret/)

BibTeX

@inproceedings{geulen2010colt-regret,
  title     = {{Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm}},
  author    = {Geulen, Sascha and Vöcking, Berthold and Winkler, Melanie},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2010},
  pages     = {132-143},
  url       = {https://mlanthology.org/colt/2010/geulen2010colt-regret/}
}