资源论文Using Gaussian Processes to Optimise Concession in Complex Negotiations against Unknown Opponents

Using Gaussian Processes to Optimise Concession in Complex Negotiations against Unknown Opponents

2019-11-12 | |  45 |   35 |   0
Abstract In multi-issue automated negotiation against unknown opponents, a key part of effective negotiation is the choice of concession strategy. In this paper, we develop a principled concession strategy, based on Gaussian processes predicting the opponent’s future behaviour. We then use this to set the agent’s concession rate dynamically during a single negotiation session. We analyse the performance of our strategy and show that it outperforms the stateof-the-art negotiating agents from the 2010 Automated Negotiating Agents Competition, in both a tournament setting and in self-play, across a variety of negotiation domains.

上一篇:Reasoning About Preferences in Intelligent Agent Systems ? Simeon Visser John Thangarajah James Harland

下一篇:Online Planning for Ad Hoc Autonomous Agent Teams Feng Wu Shlomo Zilberstein Xiaoping Chen?

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...