Abdulrahman Alrabah
Also published as: Abdulrahman AlRabah
2026
Too Polite to Disagree: Understanding Sycophancy Propagation in Multi-Agent Systems
Vira Kasprova | Amruta Parulekar | Abdulrahman AlRabah | Krishna Agaram | Ritwik Garg | Sagar Jha | Nimet Beyza Bozdag | Dilek Hakkani-Tur
Proceedings of the 27th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Vira Kasprova | Amruta Parulekar | Abdulrahman AlRabah | Krishna Agaram | Ritwik Garg | Sagar Jha | Nimet Beyza Bozdag | Dilek Hakkani-Tur
Proceedings of the 27th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Large language models (LLMs) often exhibit sycophancy: agreement with user stance even when it conflicts with the model’s opinion. While prior work has mostly studied this in single-agent settings, it remains underexplored in collaborative multi-agent systems. We ask whether awareness of other agents’ sycophancy levels influences discussion outcomes. To investigate this, we run controlled experiments with six open-source LLMs, providing agents with peer sycophancy rankings that estimate each peer’s tendency toward sycophancy. These rankings are based on scores calculated using various static (pre-discussion) and dynamic (online) strategies. We find that providing sycophancy priors reduces the influence of sycophancy-prone peers, mitigates error-cascades, and improves final discussion accuracy by an absolute 10.5%. Thus, this is a lightweight and efficient way to reduce model sycophancy during discussions and subsequently improve downstream accuracy.
GBC: Gradient-Based Connections for Optimizing Multi-Agent Systems
Xiaocheng Yang | Abdulrahman Alrabah | Dilek Hakkani-Tür | Gokhan Tur
Proceedings of the 27th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Xiaocheng Yang | Abdulrahman Alrabah | Dilek Hakkani-Tür | Gokhan Tur
Proceedings of the 27th Annual Meeting of the Special Interest Group on Discourse and Dialogue
Multi-agent systems (MAS) built on large language models (LLMs) provide a promising framework for solving complex tasks through role specialization and structured interaction. However, their performance is often limited by miscoordination and, more fundamentally, the lack of fine-grained credit assignment across agents. Existing approaches typically rely on coarse-grained feedback, making it difficult to identify which agents or interaction steps are responsible for errors. We propose Gradient-Based Connections (GBC), an approach for fine-grained attribution and optimization of multi-agent systems. GBC models a MAS as a computational graph and introduces gradient-based connection weights to quantify the influence of each agent’s output on downstream agents at the token level. By constructing an attribution graph and propagating task-specific loss signals backward, our method enables precise identification of error sources and targeted prompt optimization. We further develop AgentChord, an efficient implementation that leverages prefix-based gradient computation. Experiments on MultiWOZ and τ-bench show that GBC improves multi-agent performance and outperforms strong single-agent and multi-agent baselines, and higher attribution quality is associated with greater optimization effectiveness. Code is available at: https://github.com/yxc-cyber/AgentChord.