5 citations · 12 across the 3 of their papers we have counts for
4 papers · 1 filter
On the Verification and Computation of Strong Nash Equilibrium
Nicola Gatti, Marco Rocco, Tuomas Sandholm
Computing equilibria of games is a central task in computer science. A large number of results are known for \emph{Nash equilibrium} (NE). However, these can be adopted only when c…
Towards Better Models of Externalities in Sponsored Search Auctions
Nicola Gatti, Marco Rocco, Paolo Serafino +1
Sponsored Search Auctions (SSAs) arguably represent the problem at the intersection of computer science and economics with the deepest applications in real life. Within the realm o…
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…
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…