Tid: 17 september 2012 kl 1515-1615.Seminarierummet 3721, Institutionen för Matematik, KTH, Lindstedts väg 25, plan 7. Karta!
Föredragshållare: Troels Sørensen, Department of computer science, University of Warwick.
Titel: Computing proper equilibria of finite two-player games
Abstract Nash equilibria are commonly used to predict outcomes of strategic interactions. However, the simple stability condition defining equilibria often admit insensible behaviour by the agents. This issue has been addressed by different refinements of the equilibrium conditions. One of the most restrictive solution concepts, that are still guaranteed to exist, is the Proper equilibrium. The existing algorithms for computing this relies on numerically solving problems that are ill-conditioned, and therefore fail to solve larger games. In this talk, I present a new algorithm that avoids these problems, and computes an exact proper equilibrium. On a more technical note, the construction proves that proper equilibria of two-player games are not harder to compute than simple Nash equilibria, lending more credibility to the solution concept as a whole. I will also discuss how the results apply to the newly introduced "finely settled equilibria", which refine proper equilibria.
This talk is based on the paper Computing a Proper Equilibrium of a Bimatrix Game.
|Sidansvarig: Filip Lindskog