Marco Rocco

Learn More
The computation of a Nash equilibrium in a game is a challenging problem in artificial intelligence. This is because the computational time of the algorithms provided by the literature is, in the worst case, exponential in the size of the game. To deal with this problem, it is common the resort to concepts of approximate equilibrium. In this paper, we(More)
Computing equilibria of games is a central task in computer science. A large number of results are known for Nash equilibrium (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form coalitions, NE is inadequate and an appropriate solution concept is strong Nash equilibrium (SNE). Few computational results are(More)
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 are not an issue. However, even in this case, finding an NE is PPAD–complete. In this paper, we combine path following algorithms with local search techniques to design new(More)
Strong Nash equilibrium (SNE) is an appealing solution concept when rational agents can form coalitions. A strategy profile is an SNE if no coalition of agents can benefit by deviating. We present the first general– purpose algorithms for SNE finding in games with more than two agents. An SNE must simultaneously be a Nash equilibrium (NE) and the optimal(More)
Sponsored search is one of the most successful applications of economic mechanisms in real life. A crucial issue is the modeling of the user behavior to provide the best targeting of ads to each user. Experimental studies show that the click through rate of an ad is dramatically affected by both its position and the other displayed ads. However, these(More)
The computational characterization of game– theoretic solution concepts is a central topic in artificial intelligence, with the aim of developing com-putationally efficient tools for finding optimal ways to behave in strategic interactions. The central solution concept in game theory is Nash equilibrium (NE). However, it fails to capture the possibility(More)
The computation of a Nash equilibrium of a game is a challenging problem in artificial intelligence. This is because the computational time of the algorithms provided by the literature is, in the worst case, exponential in the size of the game. In this paper, we present, to the best of our knowledge, the first anytime algorithm based on the combination of(More)
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 of SSAs, the study of the effects that showing one ad has on the other ads, a.k.a. externalities in economics, is of utmost importance and has so far attracted the attention of(More)
In spite of the considerable research effort devoted to studying externalities in Sponsored Search Auctions (SSAs), even the basic question of modeling the problem has so far escaped a definitive answer. The popular cascade model appears too idealized to really describe the phenomenon yet it allows a good comprehension of the problem. Other models ,(More)