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

Tianyuan Jin, Hao-Lun Hsu, William Chang, Pan Xu 0002. Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs. In Michael J. Wooldridge, Jennifer G. Dy, Sriraam Natarajan, editors, Thirty-Eigth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada. pages 12956-12964, AAAI Press, 2024. [doi]

Authors

Tianyuan Jin

This author has not been identified. Look up 'Tianyuan Jin' in Google

Hao-Lun Hsu

This author has not been identified. Look up 'Hao-Lun Hsu' in Google

William Chang

This author has not been identified. Look up 'William Chang' in Google

Pan Xu 0002

This author has not been identified. Look up 'Pan Xu 0002' in Google