arXiv Computation and Language

What Makes a Social Agent's Interactions Effective? Learning from Verifiable Outcomes in Paired Worlds

The paper introduces HICO-Bench, a benchmark of 180 everyday coordination scenarios where two agents with private information converse and then record a shared plan. A program verifies that the plans are feasible and an LLM judge checks that the conversation supports the plan, defining a Verified Success. Using Paired-Credit Policy Optimization (PaCPO), the authors improve the Verified Success rate of Qwen3-8B from 20.4% to 28.3%.

arXiv AI
Jul 7

CoopEval: Benchmarking Cooperation-Sustaining Mechanisms and LLM Agents in Social Dilemmas

arXiv:2604. 15267v2 Announce Type: replace-cross Abstract: It is increasingly important that LLM agents interact effectively and safely with other goal-pursuing agents, yet, recent works report the opposite trend: LLMs with stronger reasoning capabilities behave _less_ cooperatively in mixed-motive games such as the prisoner's dilemma and public goods settings.

By Emanuel Tewolde, Xiao Zhang, David Guzman Piedrahita, Vincent Conitzer, Zhijing Jin
arXiv AI
Sep 30

Targeting Pivotal Decisions for Credit Assignment in Agentic Reinforcement Learning

arXiv:2609.36178v1 Announce Type: cross Abstract: Group Relative Policy Optimization (GRPO) has become a promising approach for training large language model agents. However, its uniform assignment o...

By Dongwon Jung, Hemanth Neelgund Ramesh, Yifan Wang, Xiaomin Li, Yuexing Hao, Yu Hu, Muhao Chen, Varun Chandrasekaran, Andrzej Banburski-Fahey, Jaron Lanier
arXiv AI
Oct 12

Learning to Report Unsafe Tasks in a Multi-Agent Game

The paper investigates how to encourage agents in a multi‑agent game to report unsafe tasks when rewards are shared. It shows that a fully shared policy can be drawn toward silence even when reporting is optimal, and derives audit conditions that guarantee policy‑gradient updates lead to universal reporting. Experiments with PPO on 24 witness graphs demonstrate that grouping witnesses into separate networks reduces unsafe task completion by over 30 percentage points compared to shuffled groups, while a fully shared network only succeeds under a common action draw.

By Avyay M. Casheekar, Hariganesh Tangirala
arXiv AI
Oct 12

Matched-Context Group Policy Optimization for LLM Agent Training

Matched-Context Group Policy Optimization (MCGPO) is a method for training long-horizon language model agents by constructing weighted action preferences from pre-collected trajectories. It defines comparison contexts using pre-action state summaries and rubric progress, and employs two-action support with exact and coarse matching rules to weight evidence for learning. Experiments across six environment-backbone settings show that MCGPO improves mean success rates over matched GraphGPO, achieving up to 5.16 percentage point gains on WebShop with Qwen3-4B and 8B models.

By Chenxu Zhang, Yaorui Shi, Wenlong Zhang, Jianchao Tan, Zihan Wang, Yiming Cheng