A Criterion for the Existence of Predictive Complexity for Binary Games

Cite

Text

Kalnishkan et al. "A Criterion for the Existence of Predictive Complexity for Binary Games." International Conference on Algorithmic Learning Theory, 2004. doi:10.1007/978-3-540-30215-5_20

Markdown

[Kalnishkan et al. "A Criterion for the Existence of Predictive Complexity for Binary Games." International Conference on Algorithmic Learning Theory, 2004.](https://mlanthology.org/alt/2004/kalnishkan2004alt-criterion/) doi:10.1007/978-3-540-30215-5_20

BibTeX

@inproceedings{kalnishkan2004alt-criterion,
  title     = {{A Criterion for the Existence of Predictive Complexity for Binary Games}},
  author    = {Kalnishkan, Yuri and Vovk, Vladimir and Vyugin, Michael V.},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2004},
  pages     = {249-263},
  doi       = {10.1007/978-3-540-30215-5_20},
  url       = {https://mlanthology.org/alt/2004/kalnishkan2004alt-criterion/}
}