4 citations · 9 across the 6 of their papers we have counts for
7 papers
The Cost of Balanced Training-Data Production in an Online Data Market
Augustin Chaintreau, Roland Maio, Juba Ziani
Many ethical issues in machine learning are connected to the training data. Online data markets are an important source of training data, facilitating both production and distribut…
AI and the EU Digital Markets Act: Addressing the Risks of Bigness in Generative AI
Ayse Gizem Yasar, Andrew Chong, Evan Dong +9
As AI technology advances rapidly, concerns over the risks of bigness in digital markets are also growing. The EU's Digital Markets Act (DMA) aims to address these risks. Still, th…
Reviews in motion: a large scale, longitudinal study of review recommendations on Yelp
Ryan Amos, Roland Maio, Prateek Mittal
The United Nations Consumer Protection Guidelines lists "access ... to adequate information ... to make informed choices" as a core consumer protection right. However, problematic…
Bridging Machine Learning and Mechanism Design towards Algorithmic Fairness
Jessie Finocchiaro, Roland Maio, Faidra Monachou +4
Decision-making systems increasingly orchestrate our world: how to intervene on the algorithmic components to build fair and equitable systems is therefore a question of utmost imp…
An efficient sampling algorithm for difficult tree pairs
Sean Cleary, Roland Maio
It is an open question whether there exists a polynomial-time algorithm for computing the rotation distances between pairs of extended ordered binary trees. The problem of computin…
Counting difficult tree pairs with respect to the rotation distance problem
Sean Cleary, Roland Maio
Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair…
Edge conflicts do not determine geodesics in the associahedron
Sean Cleary, Roland Maio
There are no known efficient algorithms to calculate distance in the one-skeleta of associahedra, a problem that is equivalent to finding rotation distance between rooted binary tr…