Computational Bounded Rationality
| Thesis title in Czech: | Výpočetní omezená racionalita |
|---|---|
| Thesis title in English: | Computational Bounded Rationality |
| Key words: | Konečné automaty, omezená racionalita, extenzivní hry, výpočetní složitost, algoritmy |
| English key words: | Discrete finite automata, bounded rationality, extensive-form games, computational complexity, algorithms |
| Academic year of topic announcement: | 2016/2017 |
| Thesis type: | diploma thesis |
| Thesis language: | angličtina |
| Department: | Department of Applied Mathematics (32-KAM) |
| Supervisor: | prof. RNDr. Martin Loebl, CSc. |
| Author: | Mgr. Jakub Černý - assigned and confirmed by the Study Dept. |
| Date of registration: | 27.10.2016 |
| Date of assignment: | 27.10.2016 |
| Confirmed by Study dept. on: | 09.11.2016 |
| Date and time of defence: | 06.09.2017 09:00 |
| Date of electronic submission: | 21.07.2017 |
| Date of submission of printed version: | 21.07.2017 |
| Date of proceeded defence: | 06.09.2017 |
| Opponents: | prof. Mgr. Milan Hladík, Ph.D. |
| Guidelines |
| Cilem prace je zkoumat zpusoby zacleneni omezene racionality do modelu extenzivnich her. |
| References |
| 1. Y. Shoham, K. Leyton-Brown, Multiagent Systems; Algorithmic, game-theoretic and logical foundations, Cambridge University Press 2009.
2. H. Simon, Models of Bounded Rationality, MIT Press 1982. 3. A. Rubinstein, Fimnite automata play the repeated prisoner's dilemma, Journal of economic theory, 1986. 4. A. Xin Jiang, T.H. Nguyen, M. Tambe, A. D. Procaccia, Monotonic Maximin: A Robust Stackelberg Solution against Boundedly Rational Followers, Decision and Game Theory for Security, LNCS vol.8252, 2013. |