- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the gap between local imitation accuracy and team utility under decentralized information. It shows when local teacher statistics fail to identify a good team policy. For symmetric binary teams, the analysis characterizes when agents should follow private signals or use a common convention. It also studies heterogeneous rules, private randomization, and time-dependent protocols. The proposed method, STCP, constructs a finite set of executable policies. It combines local learners, utility-aware learners, and predefined protocol components. The validation team's return selects the deployed policy.
Critical strengths
The reviewer thinks experimental evaluation provides stronger evidence within those environments than sampled average returns alone. In addition, selected benchmarks are reasonable.
Critical weaknesses
Although the reviewer finds good strengths in experimental results, critical weaknesses are present. The reviewre’s biggest concern is that the COGNAC comparison does not establish comparable search and evaluation costs. The validation grid contains candidate-state pairs. Anonymous IQL trains for 100,000 environment steps. The reviewer acknowledges that these quantities measure different operations, so they do not establish a direct cost ratio. However, there are no information about the total environment steps, runtime, or evaluation cost for each method. Next, the reviewer thinks that the paper do not provide enough ablation study, which isolate the contribution of the proposed protocol structure.
Questions for authors
- What information does each method receive about team utility? Which experiment isolates the benefit beyond access to the target utility?
- The reviewer wonders how the method controls candidate approximation error outside the exact binary setting. Can the method detect that all available candidates are poor?
- Following the paper, the authors exclude deterministic stationary rules that use only the current position. However, a recurrent policy can infer elapsed time from its local history. How does the synchronization result extend to policies with memory?
- COGNAC supports probabilistic influence from neighboring agents. What adjacency matrix does the experiment use? Are its transitions deterministic?
- The static phase result assumes a shared rule without agent identifiers. How do the main comparisons change when agents have identifiers or separate parameters?