Review for NeurIPS paper: Cooperative Multi-player Bandit Optimization

The paper proposes an algorithm for cooperative multi-agent games where players are trying to maximize total reward. All reviewers found the problem setting interesting and well-motivated. The two biggest concerns were the clarity of writing and how to select M when G(t) is unknown. The former was largely addressed by the authors as confirmed by the reviewers both in discussion and post-rebuttal sections of their reviews, and the scores were adjusted accordingly. The latter, however-- everyone agreed-- is problematic.