Author
de Jonge, D., Baarslag, T., Aydoğan, Reyhan, Jonker, C., Fujita, K., Ito, T.
Publication Date
2019
Publication Place
-
Springer Nature
Type
Document
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
978-303017293-0
Record ID
e1c9f56a-7e7b-4f05-a792-1a6e9931bcd3
Library Location
Computer Science
Date
2019
Notes
Horizon 2020 Framework Programme ; Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Sample Text
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.
DOI
10.1007/978-3-030-17294-7_8
Cilt
11327
