undergraduate thesis
Fundamental Algorithms in game theory and applications in practice

Dinko Tarakčija (2015)
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics and Physics
Metadata
TitlePregled osnovnih obilježja algoritama u teoriji igara i praktična primjena
AuthorDinko Tarakčija
Mentor(s)Tomislav Rudec (thesis advisor)
Ivana Hartmann Tolić (thesis advisor)
Abstract
Teorija igara predstavlja matematičku teoriju i metodologiju koja se koristi za rješavanje i analiziranje konfliktnih i djelomično konfliktnih situacija u kojima dolazi do sukoba interesa. Utemeljitelje možemo smatrati Oskara Morgensterna i Johna von Neumanna izdavanjem knjige Theory of games and Economic Behaviour 1944. godine. Teorija igara nije nužno vezana samo za igre, nego se može pronaći i ostalim dijelovima svakodnevnog života, iako ju ne primjećujemo. Postoji više načina na koje se igre mogu podijeliti, neki od njih su: igre s nultom sumom, igre za jednog ili više igrača, igre na sreću ili igre podijeljene prema predstavljanju. Također, primjene igara ima nebrojeno mnogo. Problem koji je analiziran je algoritam nasumičnosti preko funkcije nasumičnosti u C++ programskom jeziku. Funkcija nasumičnosti radi na principu linearnog kongruentnog generatora. Napravljena je aplikacija koja simulira modificiranu igru iz stvarnog života. Analizirano je koliko čovjek može igrati protiv stroja, koliko može igrati jedan protiv drugog te koliko može imati sreće ili nesreće. Testiranje je pokazalo kako čovjek ne može igrati protiv stroja jer ne može predvidjeti brojeve.
Keywordsgame theory algorithm random number generation linear congruential generator
Parallel title (English)Fundamental Algorithms in game theory and applications in practice
Committee MembersTomislav Rudec (committee chairperson)
Hrvoje Glavaš (committee member)
Marijan Herceg (committee member)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Lower level organizational unitsDepartment of Core Courses
Chair of Mathematics and Physics
PlaceOsijek
StateCroatia
Scientific field, discipline, subdisciplineTECHNICAL SCIENCES
Computing
Process Computing
Study programme typeuniversity
Study levelundergraduate
Study programmeUndergraduate University Study Programme in Computer Engineering
Academic title abbreviationuniv.bacc.ing.comp.
Genreundergraduate thesis
Language Croatian
Defense date2015-09-24
Parallel abstract (English)
Game theory can be described as a mathematical study of decision-making, conflict and strategy in social situations. It is found in many other aspects of everyday life (sociology, philosophy, computer science…). Oskar Morgenstern and John von Neumann’s book Theory of games and Economic Behaviour released in 1944.is widely recognised as the basis of game theory. There are many ways in which games in game theory can be divided: cooperative/non-cooperative, zero-sum/non-sum, games with perfect/imperfect information… That being said, there are also many ways games in game theory can be applied. The practical part of the paper is an application made in programming language C++. It simulates a real-life game and it relies on random number generation which is based on linear congruential generator. It is a two player game, but they don’t have the ability to affect the outcome of the game. Basically, the two analyses done show how random the random function inside C++ programming language really is, and it shows that it that humans can’t play against machines
Parallel keywords (Croatian)teorija igara algoritam nasumičnost linearni kongruentni generator
Resource typetext
Access conditionOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
URN:NBNhttps://urn.nsk.hr/urn:nbn:hr:200:771481
CommitterAnka Ovničević