Algoritmi određivanja Nashove ravnoteže u teoriji igara

Zadro, Marina (2015) Algoritmi određivanja Nashove ravnoteže u teoriji igara. Diploma thesis, Faculty of Science > Department of Mathematics.

[img]
Preview
PDF
Language: Croatian

Download (392kB) | Preview

Abstract

In this thesis, the finding of Nash equilibrium and subgame-perfect equilibrium was explained for two-player games. We considered normal-form and extended-form game representation (and their respective dominant strategies). Algorithms for finding Nash equilibrium in two-player games, as explained in the fourth chapter, are the base for optimal computer strategy decision making. The focus of this dissertation is the $\alpha-\beta$ pruning algorithm used for the making of the tic-tac-toe game attached to the thesis. The efficiency of finding optimal game strategy is greatly affected by limited computer resources. Therefore it is also closely affiliated with the size of the game search tree. The greater the game search tree, so grows the number of possible outcomes. Therefore, the smaller the search tree, the computer accuracy of finding the optimal strategy grows, and so does the difficulty of defeating the computer.

Item Type: Thesis (Diploma thesis)
Supervisor: Čaklović, Lavoslav
Date: 2015
Number of Pages: 45
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 29 Oct 2015 13:30
Last Modified: 29 Oct 2015 13:30
URI: http://digre.pmf.unizg.hr/id/eprint/4337

Actions (login required)

View Item View Item