Algorithmic game theory
|Thesis title in Czech:|
|Thesis title in English:||Algorithmic game theory|
|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|
|Type of assignment:||dissertation|
|Department:||Department of Applied Mathematics (32-KAM)|
|Supervisor:||doc. 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|
|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.
|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.