23 citations · 34 across the 6 of their papers we have counts for
6 papers
Private Learning in Bilateral Trade
Simone Di Gregorio, Federico Fusco, Stefano Leonardi +1
Bilateral trade models one of the most fundamental economic interactions: the intermediation between two strategic agents, a seller and a buyer, willing to trade a good. We conside…
Near-Optimal Bounds for Parameterized Euclidean k-means
Vincent Cohen-Addad, Karthik C. S., David Saulpic +1
The -means problem is a classic objective for modeling clustering in a metric space. Given a set of points in a metric space, the goal is to find representative points so as…
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds
Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon +1
In their breakthrough ICALP'15 paper, Bernstein and Stein presented an algorithm for maintaining a -approximate maximum matching in fully dynamic {\em bipartite} graphs wi…
Algorithms for Fair Team Formation in Online Labour Marketplaces
Giorgio Barnabò, Adriano Fazzone, Stefano Leonardi +1
As freelancing work keeps on growing almost everywhere due to a sharp decrease in communication costs and to the widespread of Internet-based labour marketplaces (e.g., guru.com, f…
Fair Clustering with Multiple Colors
Matteo Böhm, Adriano Fazzone, Stefano Leonardi +1
A fair clustering instance is given a data set in which every point is assigned some color. Colors correspond to various protected attributes such as sex, ethnicity, or age. A…
Principal Fairness: Removing Bias via Projections
Aris Anagnostopoulos, Luca Becchetti, Adriano Fazzone +2
Reducing hidden bias in the data and ensuring fairness in algorithmic data analysis has recently received significant attention. We complement several recent papers in this line of…