The challenge of negotiation in the game of Diplomacy
The game of Diplomacy has been used as a test case for complex automated negotiations for a long time, but to date very few successful negotiation algorithms have been implemented for this game. We have therefore decided to include a Diplomacy tournament within the annual Automated Negotiating Agents Competition (ANAC). In this paper we present the setup and the results of the ANAC 2017 Diplomacy Competition and the ANAC 2018 Diplomacy Challenge. We observe that none of the negotiation algorithms submitted to these two editions have been able to significantly improve the performance over a non-negotiating baseline agent. We analyze these algorithms and discuss why it is so hard to write successful negotiation algorithms for Diplomacy. Finally, we provide experimental evidence that, despite these results, coalition formation and coordination do form essential elements of the game.
|Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence|
|Representing Users in a Negotiation (RUN): An Autonomous Negotiator Under Preference Uncertainty|
|This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/639.021.751 - Representing Users in a Negotiation (RUN): An Autonomous Negotiator Under Preference Uncertainty|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
de Jonge, D, Baarslag, T, Aydoğan, R, Jonker, C.M, Fujita, K., & Ito, T. (2018). The challenge of negotiation in the game of Diplomacy. In AT 2018: Agreement Technologies (pp. 100–114). doi:10.1007/978-3-030-17294-7_8