Skip to Main content Skip to Navigation
Conference papers

MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo

Abstract : Automated negotiation is a rising topic in Artificial Intelligence research. Monte Carlo methods have got increasing interest, in particular since they have been used with success on games with high branching factor such as go. In this paper, we describe an Monte Carlo Negotiating Agent (MoCaNA) whose bidding strategy relies on Monte Carlo Tree Search. We provide our agent with opponent modeling tehcniques for bidding strtaegy and utility. MoCaNA can negotiate on continuous negotiating domains and in a context where no bound has been specified. We confront MoCaNA and the finalists of ANAC 2014 and a RandomWalker on different negotiation domains. Our agent ouperforms the RandomWalker in a domain without bound and the majority of the ANAC finalists in a domain with a bound.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01895773
Contributor : Cédric Buron <>
Submitted on : Monday, October 15, 2018 - 2:49:59 PM
Last modification on : Thursday, November 26, 2020 - 3:58:08 PM
Long-term archiving on: : Wednesday, January 16, 2019 - 2:51:11 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01895773, version 1
  • ARXIV : 1810.06918

Citation

Cédric Buron, Zahia Guessoum, Sylvain Ductor, Olivier Roussel. MoCaNA, un agent de négociation automatique utilisant la recherche arborescente de Monte-Carlo. Vingt-sixièmes Journées Francophones sur les Systèmes Multi-Agents, Oct 2018, Métabief, France. ⟨hal-01895773⟩

Share

Metrics

Record views

352

Files downloads

122