Communication complexity as a lower bound for learning in games

Vincent Conitzer, Tuomas Sandholm. Communication complexity as a lower bound for learning in games. In Carla E. Brodley, editor, Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004. Volume 69 of ACM International Conference Proceeding Series, ACM, 2004. [doi]

@inproceedings{ConitzerS04:0,
  title = {Communication complexity as a lower bound for learning in games},
  author = {Vincent Conitzer and Tuomas Sandholm},
  year = {2004},
  doi = {10.1145/1015330.1015351},
  url = {http://doi.acm.org/10.1145/1015330.1015351},
  researchr = {https://researchr.org/publication/ConitzerS04%3A0},
  cites = {0},
  citedby = {0},
  booktitle = {Machine Learning, Proceedings of the Twenty-first International Conference (ICML 2004), Banff, Alberta, Canada, July 4-8, 2004},
  editor = {Carla E. Brodley},
  volume = {69},
  series = {ACM International Conference Proceeding Series},
  publisher = {ACM},
}