5 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.GT2013★ 3 cited
On the complexity of strong Nash equilibrium: Hard-to-solve instances and smoothed complexity
Nicola Gatti, Marco Rocco, Tuomas Sandholm
The computational characterization of game-theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing computationally efficient tools for…
cs.GT2012★ 5 cited
Combining local search techniques and path following for bimatrix games
Nicola Gatti, Giorgio Patrini, Marco Rocco +1
Computing a Nash equilibrium (NE) is a central task in computer science. An NE is a particularly appropriate solution concept for two-agent settings because coalitional deviations…