Optimal Stragies and Minimax Lower Bounds for Online Convex Games

Cite

Text

Abernethy et al. "Optimal Stragies and Minimax Lower Bounds for Online Convex Games." Annual Conference on Computational Learning Theory, 2008.

Markdown

[Abernethy et al. "Optimal Stragies and Minimax Lower Bounds for Online Convex Games." Annual Conference on Computational Learning Theory, 2008.](https://mlanthology.org/colt/2008/abernethy2008colt-optimal/)

BibTeX

@inproceedings{abernethy2008colt-optimal,
  title     = {{Optimal Stragies and Minimax Lower Bounds for Online Convex Games}},
  author    = {Abernethy, Jacob D. and Bartlett, Peter L. and Rakhlin, Alexander and Tewari, Ambuj},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2008},
  pages     = {415-424},
  url       = {https://mlanthology.org/colt/2008/abernethy2008colt-optimal/}
}