“…In any case, equilibria are often seen as a state to which play could reasonably converge, rather than an outcome that can necessarily be arrived at immediately by deduction. Many other solution concepts have been studied from a computational perspective, including refinements of Nash equilibrium [Hansen et al, 2010;Sørensen, 2012], coarsenings of Nash equilibrium (such as correlated equilibrium [Papadimitriou and Roughgarden, 2008;Jiang and Leyton-Brown, 2013] and equilibria of repeated games [Littman and Stone, 2005;Borgs et al, 2010;Kontogiannis and Spirakis, 2008]), and incomparable concepts such as Stackelberg equilibrium [Conitzer and Sandholm, 2006;von Stengel and Zamir, 2010].…”