3 papers
cs.DS2026
Learning Multinomial Logits in time
Flavio Chierichetti, Mirko Giacchini, Ravi Kumar +4
A Multinomial Logit (MNL) model is composed of a finite universe of items , each assigned a positive weight. A query specifies an admissible subset -- called a sl…
cs.CC2025
Man, these New York Times games are hard! A computational perspective
Alessandro Giovanni Alberti, Flavio Chierichetti, Mirko Giacchini +3
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 b…
cs.DS2025
A New Impossibility Result for Online Bipartite Matching Problems
Flavio Chierichetti, Mirko Giacchini, Alessandro Panconesi +1
Online Bipartite Matching with random user arrival is a fundamental problem in the online advertisement ecosystem. Over the last 30 years, many algorithms and impossibility results…