3 papers
cs.GT2020
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…
cs.DS2020
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…
cs.DS2020
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…