18 citations · 49 across the 9 of their papers we have counts for
10 papers
Approximating a RUM from Distributions on k-Slates
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar +2
In this work we consider the problem of fitting Random Utility Models (RUMs) to user choices. Given the winner distributions of the subsets of size of a universe, we obtain a p…
About latent roles in forecasting players in team sports
Luca Scofano, Alessio Sampieri, Giuseppe Re +3
Forecasting players in sports has grown in popularity due to the potential for a tactical advantage and the applicability of such research to multi-agent interaction systems. Team…
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re +1
Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a laten…
OLIVAW: Mastering Othello without Human Knowledge, nor a Fortune
Antonio Norelli, Alessandro Panconesi
We introduce OLIVAW, an AI Othello player adopting the design principles of the famous AlphaGo programs. The main motivation behind OLIVAW was to attain exceptional competence in a…
Faster motif counting via succinct color coding and adaptive sampling
Marco Bressan, Stefano Leucci, Alessandro Panconesi
We address the problem of computing the distribution of induced connected subgraphs, aka \emph{graphlets} or \emph{motifs}, in large graphs. The current state-of-the-art algorithms…
Motivo: fast motif counting via succinct color coding and adaptive sampling
Marco Bressan, Stefano Leucci, Alessandro Panconesi
The randomized technique of color coding is behind state-of-the-art algorithms for estimating graph motif counts. Those algorithms, however, are not yet capable of scaling well to…