Title: Strong Nash equilibria: complexity and algorithms
Abstract: Strong Nash equilibrium is an interesting solution concept merging the idea of Nash equilibrium and Pareto efficiency. It captures the scenario in which players can form communicate before playing and can form coalitions. Such a solution concept is more appealing than Nash equilibrium in many digital scenarios, e.g., Internet, where players can communicate by means of the Web. In the talk, the complexity of deciding whether a Strong Nash equilibrium is present in a given game will be discussed and equilibrium-finding algorithms will be presented.
Room: Sala Conferenze (DEIB)
Date: November 5 2014
Time: 12:00 - 13:00