English

Learning to Negotiate via Voluntary Commitment

Artificial Intelligence 2025-03-20 v2 Computer Science and Game Theory Machine Learning Multiagent Systems

Abstract

The partial alignment and conflict of autonomous agents lead to mixed-motive scenarios in many real-world applications. However, agents may fail to cooperate in practice even when cooperation yields a better outcome. One well known reason for this failure comes from non-credible commitments. To facilitate commitments among agents for better cooperation, we define Markov Commitment Games (MCGs), a variant of commitment games, where agents can voluntarily commit to their proposed future plans. Based on MCGs, we propose a learnable commitment protocol via policy gradients. We further propose incentive-compatible learning to accelerate convergence to equilibria with better social welfare. Experimental results in challenging mixed-motive tasks demonstrate faster empirical convergence and higher returns for our method compared with its counterparts. Our code is available at https://github.com/shuhui-zhu/DCL.

Keywords

Cite

@article{arxiv.2503.03866,
  title  = {Learning to Negotiate via Voluntary Commitment},
  author = {Shuhui Zhu and Baoxiang Wang and Sriram Ganapathi Subramanian and Pascal Poupart},
  journal= {arXiv preprint arXiv:2503.03866},
  year   = {2025}
}

Comments

Accepted by AISTATS 2025

R2 v1 2026-06-28T22:08:20.915Z