Events
AdONE Seminar: Margarida Carvalho (University of Montreal)
In the first part, I revisit the background on IPGs, describe algorithmic methodologies to compute correlated and Nash equilibria, and present computational experiments. In the second part, we focus on Nash games played by Stackelberg leaders and demonstrate how a series of results in polyhedra theory allow to show that they are IPG-representable. Moreover, an innter approximation algorithm for the computation of equilibria will be presented.