In this colloquium, Frank Nietzsche will present his master thesis titled “Game Theory- distributed solving”
Game theory analyzes the behavior of individuals in complex situations. One popular game in Europe and North America with such a complex situation is Skat. For the analysis of the game, the counterfactual regret minimization algorithm (CFR algorithm) was applied. Unfortunately, there is no guarantee that the algorithm works in three-person games. In general, it is difficult to solve three-person games. In addition, the algorithm calculates only a epsilon-Nash equilibrium. But for Skat, the Perfect Bayesian equilibrium would be a better solution. In fact, the Perfect Bayesian equilibrium is a subset of the Nash equilibrium. This raises the question of whether a Perfect Bayesian equilibrium can be calculated using the CFR algorithm. The analysis of this problem will be the last part of the presentation.
The second talk of the colloquium, Dr. Michael Martin will announce the student thesis on the AKSW website.
About the AKSW Colloquium
This event is part of a series of events about Semantic Web technology. Please see http://wiki.aksw.org/Colloquium for further information about previous and future events. As always, Bachelor and Master students are able to get points for attendance and there is complimentary coffee and cake after the session.