A Contextual Combinatorial Bandit Approach to Negotiation
Not on the map. Why?
Abstract (arXiv)
Learning effective negotiation strategies poses two key challenges: the exploration-exploitation dilemma and dealing with large action spaces. However, there is an absence of learning-based approaches that effectively address these challenges in negotiation. This paper introduces a comprehensive formulation to tackle various negotiation problems. Our approach leverages contextual combinatorial multi-armed bandits, with the bandits resolving the exploration-exploitation dilemma, and the combinatorial nature handles large action spaces. Building upon this formulation, we introduce NegUCB, a novel method that also handles common issues such as partial observations and complex reward functions in negotiation. NegUCB is contextual and tailored for full-bandit feedback without constraints on the reward functions. Under mild assumptions, it ensures a sub-linear regret upper bound. Experiments conducted on three negotiation tasks demonstrate the superiority of our approach.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 39 references that are in the map. First posted on arXiv 30 Jun 2024.
Builds on
15 of 39 references.
References · 15
- 2017On Kernelized Multi-armed Banditscited by 352
- 2017Deal or No Deal? End-to-End Learning for Negotiation Dialoguescited by 209
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 161
- 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 158
- 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
- 2018Emergent Communication through Negotiationcited by 62
- 2024CivRealm: A Learning and Reasoning Odyssey in Civilization for Decision-Making Agentscited by 42
- 2019No Press Diplomacy: Modeling Multi-Agent Gameplaycited by 38
- 2014Efficient Learning in Large-Scale Combinatorial Semi-Banditscited by 36
- 2019Top-k Combinatorial Bandits with Full-Bandit Feedbackcited by 28
- 2023Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedbackcited by 19
3 more
- 2023Delayed Feedback in Kernel Banditscited by 10
- 2020A Deep Reinforcement Learning Approach to Concurrent Bilateral Negotiationcited by 6
- 2019MCTS-based Automated Negotiation Agentcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.