Search in Imperfect Information Games
| Thesis title in Czech: | Hledání v hrách s neúplnou informací |
|---|---|
| Thesis title in English: | Search in Imperfect Information Games |
| Key words: | game theory|large extensive form games|Nash equilibrium|optimization |
| English key words: | game theory|large extensive form games|Nash equilibrium|optimization |
| Academic year of topic announcement: | 2012/2013 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Department of Applied Mathematics (32-KAM) |
| Supervisor: | prof. Mgr. Milan Hladík, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 30.09.2013 |
| Date of assignment: | 30.09.2013 |
| Confirmed by Study dept. on: | 09.12.2013 |
| Date and time of defence: | 25.08.2021 16:00 |
| Date of electronic submission: | 17.06.2021 |
| Date of submission of printed version: | 17.06.2021 |
| Date of proceeded defence: | 25.08.2021 |
| Opponents: | Csaba Szepesvari |
| Mgr. Branislav Bošanský | |
| Advisors: | Michael Bowling |
| Guidelines |
| The existence of optimal strategies for very general classes of games is
well known since 1950's. These optimal strategies are applied to markets, traffic optimization, decision making etc. It's desirable to compute such strategies, and to compute them efficiently. Surprisingly, most of the results regarding computability, complexity or eventually convergence speed were discovered in the last few years. But there are still many interesting and challenging problems. |
| References |
| Martin J. Osborne, Ariel Rubinstein: A Course in Game Theory, The MIT Press, Cambridge, 1994.
Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani: Algorithmic Game Theory, Cambridge University Press, 2007. |