[Date Prev][Date Next][Date Index]
Vortrag S. Vorobyov: Games as Controlled Optimization Problems
Liebe Kolleginnen und Kollegen!
Wir laden recht herzlich zu folgendem Vortrag am
Donnerstag, 15.11. 15:00 Uhr
Games as Controlled Optimization Problems
by Sergei Vorobyov
We argue that several prominent two-person adversary games relevant
for Computer-Aided Verification can be regarded as Controlled
Optimization Problems (COPs). A COP is obtained from some well-known
optimization problem (OP) by introducing some discrete parameters. One
player is optimizing the choice of these parameters, while the other
one optimizes within the underlying OP.
Not only this view allows for uniformly explaining and studying games,
more importantly, it leads to better, previously unknown, decision
algorithms for games.
We will illustrate by using Mean Payoff, Parity, Discounted Payoff,
and Simple Stochastic Games.
Just a basic knowledge of algorithms is preassumed.