Gradient-Optimized Suffixes for Collusion Mitigation in LLM Multi-Agent Systems
Yike Ouyang, benjamin REAU · Team Waynflete team
Submitted to AI Collusion Research Sprint. Sprint projects are early-stage work by participants, not Apart Research publications.
Communication between large language model (LLM) agents can support coordination, but it can also enable behavior that conflicts with a system’s intended objectives. We investigate whether Greedy Coordinate Gradient (GCG) can be repurposed to optimize token suffixes for collusion mitigation without modifying model weights. Two environments are considered: a repeated three-player Rock-Paper-Scissors (RPS) game and a two-agent certification task, AgentCollusion (AC). In RPS, optional private communication is associated with increased action dependence across Qwen2.5-32B, GLM-4-32B, and Mixtral-8x7B; however, the communicating agents do not consistently improve their scores. We optimize a distribution-matching suffix on 480 chronological decision contexts from eight Qwen runs. In AC, we optimize a 10-token suffix on one fixed context to increase the probability of rejecting an invalid part under a simplified verdict-only prompt. The AC probe loss reaches approximately 1.1110−4, demonstrating successful optimization of the local objective. Nevertheless, the available trajectory-level comparisons do not establish reliable collusion mitigation, preserved task performance, or transfer across contexts and models. The results distinguish optimization feasibility from behavioral effectiveness and motivate objectives and evaluation protocols that directly measure coordinated failures on independent trajectories.
Reviews
No public critique yet.
Cite this project
@misc{ouyang2026gradientoptimized,
title = {{Gradient-Optimized Suffixes for Collusion Mitigation in LLM Multi-Agent Systems}},
author = {Yike Ouyang and benjamin REAU},
year = {2026},
month = oct,
note = {Submitted to AI Collusion Research Sprint, an Apart Research Sprint},
howpublished = {\url{https://apartresearch.com/sprints/projects/gradientoptimized-suffixes-for-collusion-mitigation-in-llm-multiagent-systems-l6vo}},
url = {https://apartresearch.com/sprints/projects/gradientoptimized-suffixes-for-collusion-mitigation-in-llm-multiagent-systems-l6vo}
}More from AI Collusion Research Sprint
- View project: Is It a Cartel? Separating Enforced from Spurious Collusion in LLM Pricing Agents
Is It a Cartel? Separating Enforced from Spurious Collusion in LLM Pricing Agents
When LLM pricing agents keep prices above the competitive level, are they running a cartel, or are they simply stuck? Only the first is collusion, and the two call for opposite remedies. We introduce a black-box causal …
- View project: Every Permission Checked: Source-Linked Evidence for Auditing Finance Agents
Every Permission Checked: Source-Linked Evidence for Auditing Finance Agents
When multiple AI agents contribute to a policy violation, the same outcome can reflect cooperation, deception of a helper, or an independent mistake. We study how evidence presentation affects this distinction in a …
- View project: Swapping the Model Does Not Reset the Price: What LLM Pricing Agents Inherit After a Model Replacement
Swapping the Model Does Not Reset the Price: What LLM Pricing Agents Inherit After a Model Replacement
Emerald
We test what happens when one of two LLM pricing agents has its model replaced, the open problem posed in the sprint's question 1.2. Two gpt-oss-120b agents priced for 150 rounds; we then swapped one agent's model to …