Skip to Main content Skip to Navigation
Conference papers

MCTS-based Automated Negotiation Agent (Extended Abstract)

Abstract : This paper introduces a new Negotiating Agent for automated negotiation on continuous domains and without considering a specified deadline. The agent bidding strategy relies on Monte Carlo Tree Search, which is a trendy method since it has been used with success on games with high branching factor such as Go. It uses two opponent modeling techniques for its bidding strategy and its utility: Gaussian process regression and Bayesian learning. Evaluation is done by confronting the existing agents that are able to negotiate in such context: Random Walker, Tit-for-tat and Nice Tit-for-Tat. None of those agents succeeds in beating our agent; moreover the modular and adaptive nature of our approach is a huge advantage when it comes to optimize it in specific applicative contexts.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02080839
Contributor : Cédric Buron <>
Submitted on : Saturday, April 13, 2019 - 12:59:40 PM
Last modification on : Saturday, October 24, 2020 - 11:18:02 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02080839, version 2
  • ARXIV : 1903.12411

Citation

Cédric Buron, Zahia Guessoum, Sylvain Ductor. MCTS-based Automated Negotiation Agent (Extended Abstract). AAMAS 2019 - 18th International Conference on Autonomous Agents and MultiAgent Systems, May 2019, Montreal, Canada. pp.1850-1852. ⟨hal-02080839v2⟩

Share

Metrics

Record views

120

Files downloads

61