Finding the global minimum of mathematical functions is a very difficult
problem, for which there is no algorithm of polynomial time complexity. By
using Lasserre hierarchies, we can search for the global minimum in an effi-
cient way, but we have no guarantee that we will actually find it within the
computational capabilities of today’s software. In this thesis we apply these
hierarchies to the field of game theory for two players and search for the opti-
mal strategies of both players. We statistically analyze the time complexity
of individual levels of hierarchies and find boundary uses of hierarchies in
this area.
|
