Game theory is the study of strategic interaction between rational agents. The need for understanding interaction arises in many different fields, such as: economics, psychology, philosophy, computer science and biology. The purpose of game theory is to analyse the outcomes and strategies of these interactions, in mathematical models called games. Some of these games have stood out from the rest, e.g. Prisoner's Dilemma, Chicken and Stag Hunt. These games, commonly referred to as the standard games, have attracted interest from many fields of research. In order to understand why these games are interesting and how they differ from each other and other games, many have attempted to sort games into interestingly different classes. In this thesis some already existing classifications are reviewed based on their mathematical structure and how well justified they are. Emphasis is put on mathematical simplicity because it makes the classification more generalisable to larger game spaces. From this review we conclude that none of the classifications captures both of these aspects. We therefore propose a classification of symmetric 2x2 games based on decomposition. We show that our proposed method captures everything that the previous classifications caputure. Our method arguably explains the interesting differences between the games, and we justify this claim by computer experiments. Moreover it has a simple mathematical structure. We also provide some results concerning the size of different game spaces.
Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:liu-137991 |
Date | January 2017 |
Creators | Böörs, Mikael, Wängberg, Tobias |
Publisher | Linköpings universitet, Matematisk statistik, Linköpings universitet, Tekniska fakulteten, Linköpings universitet, Matematisk statistik, Linköpings universitet, Tekniska fakulteten |
Source Sets | DiVA Archive at Upsalla University |
Language | English |
Detected Language | English |
Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
Format | application/pdf |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0023 seconds