Abstract | ||
---|---|---|
The Iterated Prisoner’s Dilemma (IPD) game is a one of the most popular subjects of study in game theory. Numerous experiments have investigated many properties of this game over the last decades. However, topics related to the simulation scale did not always play a significant role in such experimental work. The main contribution of this paper is the optimization of IPD strategies performed in a distributed actor-based computing and simulation environment. Besides showing the scalability and robustness of the framework, we also dive into details of some key simulations, analyzing the most successful strategies obtained. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1007/978-3-662-58611-2_4 | Trans. Computational Collective Intelligence |
Field | DocType | Volume |
Parallel simulation,Computer science,Prisoner's dilemma,Theoretical computer science,Robustness (computer science),Game theory,Dilemma,Iterated function,Scalability | Journal | 32 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Grazyna Starzec | 1 | 3 | 2.10 |
Mateusz Starzec | 2 | 0 | 0.34 |
Aleksander Byrski | 3 | 269 | 45.03 |
Marek Kisiel-Dorohinicki | 4 | 274 | 42.43 |
Juan C. Burguillo-rial | 5 | 369 | 40.17 |
Tom Lenaerts | 6 | 276 | 53.44 |