MoL-2024-32: Vromen, Wouter (2024) The Computational Complexity of Diplomacy. [Report]
Preview |
Text
MoL-2024-32.text.pdf - Accepted Version Download (432kB) | Preview |
Abstract
In this thesis, we will provide a generalisation for the 1959 board game Diplomacy, remaining close to the original rules of the game. We then formulate some decision problems based on this generalisation, and determine their complexity class.
While the database of generalised games for the purposes of complexity theoretic research is vast, it did not contain a version of generalised Diplomacy yet. Meanwhile the game has attracted the attention of various other fields of research, such as artificial intelligence and automated negotiation.
Further contributions in this thesis are a mathematical framework for the moves of the game and the following move resolution. We construct a polynomial-time deterministic algorithm that resolves the submitted moves by the players. Using the proposed generalisation, we also formulate strategic in-game problems as decision problems, and show in which complexity class they reside. An example of these questions is how hard it is to find a defensive strategy that holds all provinces in a given set, both with or without knowledge about the incoming attack on those provinces.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2024-32 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2024 |
| Subjects: | Computation Logic |
| Depositing User: | Dr Marco Vervoort |
| Date Deposited: | 10 Nov 2026 14:29 |
| Last Modified: | 10 Nov 2026 14:29 |
| URI: | https://eprints.illc.uva.nl/id/eprint/2463 |
Actions (login required)
 |
View Item |
