Alessandro Panconesi
YOU?
Author Swipe
View article: Man, these New York Times games are hard! A computational perspective
Man, these New York Times games are hard! A computational perspective Open
The New York Times (NYT) games have found widespread popularity in recent years and reportedly account for an increasing fraction of the newspaper's readership. In this paper, we bring the computational lens to the study of New York Times …
View article: A Topology-Based Approach for Predicting Toxic Outcomes on Twitter and YouTube
A Topology-Based Approach for Predicting Toxic Outcomes on Twitter and YouTube Open
The benefits of an information ecosystem based on social media platforms came at the cost of the rise of several antisocial behaviours, including the use of toxic speech. To assess the aspects that concur with the formation of toxic conver…
View article: About Latent Roles in Forecasting Players in Team Sports
About Latent Roles in Forecasting Players in Team Sports Open
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 sports contain a significant social component that influenc…
View article: Coordinating "7 Billion Humans" Is Hard
Coordinating "7 Billion Humans" Is Hard Open
In the video game "7 Billion Humans", the player is requested to direct a group of workers to various destinations by writing a program that is executed simultaneously on each worker. While the game is quite rich and, indeed, it is conside…
View article: Information foraging with an oracle
Information foraging with an oracle Open
During ecological decisions, such as when foraging for food or selecting a weekend activity, we often have to balance the costs and benefits of exploiting known options versus exploring novel ones. Here, we ask how individuals address such…
View article: Errare humanum est, perseverare autem diabolicum
Errare humanum est, perseverare autem diabolicum Open
International audience
View article: Approximating a RUM from Distributions on k-Slates
Approximating a RUM from Distributions on k-Slates Open
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 $k$ of a universe, we obtain a polynomial-time algorithm that finds the RUM that best appro…
View article: About latent roles in forecasting players in team sports
About latent roles in forecasting players in team sports Open
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 sports contain a significant social component that influenc…
View article: k-Clustering with Fair Outliers
k-Clustering with Fair Outliers Open
Clustering problems and clustering algorithms are often overly sensitive to the presence of outliers: even a handful of points can greatly affect the structure of the optimal solution and its cost. This is why many algorithms for robust cl…
View article: Correlation Clustering Reconstruction in Semi-Adversarial Models
Correlation Clustering Reconstruction in Semi-Adversarial Models Open
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 latent clustering that has been corrupted by random noise and ad…
View article: Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models Open
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 latent clustering that has been corrupted by random noise and ad…
View article: Twin Peaks, a Model for Recurring Cascades
Twin Peaks, a Model for Recurring Cascades Open
Understanding information dynamics and their resulting cascades is a central topic in social network analysis. In a recent seminal work, Cheng et al. analyzed multiples cascades on Facebook over several months, and noticed that many of the…
View article: Songs of a Future Past, an Experimental Study of Online Persuaders
Songs of a Future Past, an Experimental Study of Online Persuaders Open
In this paper, we present the results of an extensive experimental study on users decisions inside an online setting. In the experiment, participants purchase songs using real money while having enough time to explore them at leisure befor…
View article: Motif Counting Beyond Five Nodes
Motif Counting Beyond Five Nodes Open
This is the preprint version of an ACM TKDD paper, https://doi.org/10.1145/3186586.
View article: OLIVAW: Mastering Othello without Human Knowledge, nor a Fortune
OLIVAW: Mastering Othello without Human Knowledge, nor a Fortune Open
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 non-trivial board game at a tiny fraction of the cost of i…
View article: OLIVAW: Mastering Othello with neither Humans nor a Penny.
OLIVAW: Mastering Othello with neither Humans nor a Penny. Open
We introduce OLIVAW, an AI Othello player adopting the design principles of the famous AlphaGo series. The main motivation behind OLIVAW was to attain exceptional competence in a non-trivial board game at a tiny fraction of the cost of its…
View article: Motivo
Motivo Open
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 very large graphs with billions of edges. In this paper we …
View article: Motivo: fast motif counting via succinct color coding and adaptive sampling
Motivo: fast motif counting via succinct color coding and adaptive sampling Open
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 very large graphs with billions of edges. In this paper we …
View article: On the Distortion of Locality Sensitive Hashing
On the Distortion of Locality Sensitive Hashing Open
Given a notion of pairwise similarity between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity.…
View article: A Reduction for Efficient LDA Topic Reconstruction
A Reduction for Efficient LDA Topic Reconstruction Open
We present a novel approach for LDA (Latent Dirichlet Allocation) topic reconstruction. The main technical idea is to show that the distribution over the documents generated by LDA can be transformed into a distribution for a much simpler …
View article: Songs of a Future Past — An Experimental Study of Online Persuaders
Songs of a Future Past — An Experimental Study of Online Persuaders Open
In this paper, we present the results of an extensive experimental study on users decisions inside an online setting. In the experiment, participants purchase songs using real money while having enough time to explore them at leisure befor…
View article: Motif Counting Beyond Five Nodes
Motif Counting Beyond Five Nodes Open
Counting graphlets is a well-studied problem in graph mining and social network analysis. Recently, several papers explored very simple and natural algorithms based on Monte Carlo sampling of Markov Chains (MC), and reported encouraging re…
View article: Rumor Spreading and Conductance
Rumor Spreading and Conductance Open
In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance ϕ then, with high probability, PUSH-PULL will deliver the …
View article: Tracks from hell - when finding a proof may be easier than checking it
Tracks from hell - when finding a proof may be easier than checking it Open
We consider the popular smartphone game Trainyard: a puzzle game that requires the player to lay down tracks in order to route colored trains from departure stations to suitable arrival stations. While it is already known [Almanza et al., …
View article: Counting Graphlets
Counting Graphlets Open
Counting graphlets is a well-studied problem in graph mining and social network analysis. Recently, several papers explored very simple and natural approaches based on Monte Carlo sampling of Markov Chains (MC), and reported encouraging re…
View article: The Distortion of Locality Sensitive Hashing
The Distortion of Locality Sensitive Hashing Open
Given a pairwise similarity notion between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity. LS…
View article: On The Distortion of Locality Sensitive Hashing
On The Distortion of Locality Sensitive Hashing Open
Given a notion of pairwise similarity between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity.…