Distinct-peer random routing improves cost-efficiency in sparse multi-agent debate (arXiv:2609.27150v1)
This arXiv preprint (arXiv:2609.27150v1) studies sparse multi-agent debate (MAD) and finds that a simple random-without-replacement routing policy—where each agent debates with two distinct newly sampled peers each round—yields a strong baseline that improves the accuracy–cost trade-off. The authors also show that lightweight deliberation stopping substantially reduces inference cost while preserving competitive accuracy, and argue that learned or complex topology control should be compared against these simple routing and stopping baselines.