Brauna-Robinsones iteratīvā metode
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
lav
Abstract
Bakalaura darbā ir aprakstīta Brauna-Robinsones iteratīvā metode, kas paredzēta nulles summas spēļu optimālo atrisinājumu atrašanai jauktajās stratēģijās. Darbs satur tos spēļu teorijas jēdzienu aprakstus, kas nepieciešami Brauna-Robinsones metodes izpratnei. Plašāk izklāstītas spēles ar nulles summu. Visi jēdzieni ilustrēti ar piemēriem. Brauna-Robinsones algoritms ilustrēts ar trīs piemēriem, kuri realizēti MATLAB vidē. Metodiska rakstura darbs.
The bachelor's thesis describes the Brown-Robinson iterative method for finding optimal solutions for zero-sum games in mixed strategies. The work contains those descriptions of the terms of game theory that are necessary for understanding the Brown-Robinson method. Zero-sum games are considered more extensively. All terms are illustrated with examples. The Brown-Robinson algorithm is illustrated with three examples that have been implemented in the MATLAB environment. Work of a methodical nature.
The bachelor's thesis describes the Brown-Robinson iterative method for finding optimal solutions for zero-sum games in mixed strategies. The work contains those descriptions of the terms of game theory that are necessary for understanding the Brown-Robinson method. Zero-sum games are considered more extensively. All terms are illustrated with examples. The Brown-Robinson algorithm is illustrated with three examples that have been implemented in the MATLAB environment. Work of a methodical nature.