Marco Rocco

Learn 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)
The purpose of the Temi di discussione series is to promote the circulation of working papers prepared within the Bank of Italy or presented in Bank seminars by outside economists with the aim of stimulating comments and suggestions. The views expressed in the articles are those of the authors and do not involve the responsibility of the Bank. Abstract The(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 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)
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)
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 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 constitute one of the most successful applications of microeconomic mechanisms. In mechanism design, auctions are usually designed to incentivize advertisers to bid their truthful valuations and, at the same time, to assure both the advertisers and the auctioneer a non–negative utility. Nonetheless, in sponsored search auctions,(More)