Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs

Cite

Text

Jin et al. "Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs." AAAI Conference on Artificial Intelligence, 2024. doi:10.1609/AAAI.V38I11.29193

Markdown

[Jin et al. "Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs." AAAI Conference on Artificial Intelligence, 2024.](https://mlanthology.org/aaai/2024/jin2024aaai-finite/) doi:10.1609/AAAI.V38I11.29193

BibTeX

@inproceedings{jin2024aaai-finite,
  title     = {{Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs}},
  author    = {Jin, Tianyuan and Hsu, Hao-Lun and Chang, William and Xu, Pan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {12956-12964},
  doi       = {10.1609/AAAI.V38I11.29193},
  url       = {https://mlanthology.org/aaai/2024/jin2024aaai-finite/}
}