Considering computational costs in non-cooperative games

Abstract

In this thesis we explore the effects of computations on non-cooperative games. Initially, we examine the practical implications of large computational processes to the solution of games. Then, basic notions and concepts of complexity theory are introduced in order to understand the effects of complexity on games. We proceed to discuss some central topics of the field of game complexity, with the most important one being the intractability of the concept of Nash equilibrium. The examination of complexity from the perspective of players follows. Finally, a concept of the effects of computational complexity on strategic decision making is developed and discussed.