prikaz prve stranice dokumenta Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena
  Download
PDF 148.97 KB
undergraduate thesis
Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena
2015. urn:nbn:hr:200:771481
Tarakčija, Dinko
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Cite this document

Tarakčija, D. (2015). Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:771481

Tarakčija, Dinko. "Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2015. https://urn.nsk.hr/urn:nbn:hr:200:771481

Tarakčija, Dinko. "Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2015. https://urn.nsk.hr/urn:nbn:hr:200:771481

Tarakčija, D. (2015). 'Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 10 December 2024, https://urn.nsk.hr/urn:nbn:hr:200:771481

Tarakčija D. Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2015 [cited 2024 December 10] Available at: https://urn.nsk.hr/urn:nbn:hr:200:771481

D. Tarakčija, "Pregled osnovnih obilježja algoritama u teoriji igara i praktična primjena", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2015. Available at: https://urn.nsk.hr/urn:nbn:hr:200:771481

Please login to the repository to save this object to your list.
Metadata
TitlePregled osnovnih obilježja algoritama u teoriji igara i praktična primjena
Title (english)Fundamental Algorithms in game theory and applications in practice
AuthorDinko Tarakčija
MentorTomislav Rudec (mentor)
MentorIvana Hartmann Tolić (mentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
Committee memberHrvoje Glavaš (član povjerenstva)
Committee memberMarijan Herceg (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2015-09-24, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
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.
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
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:771481
Study programmeTitle: Undergraduate University Study Programme in Computer Engineering
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2016-08-02 10:57:55