4 papers
Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
Ameet Gadekar, Aristides Gionis, Suhas Thejaswi +1
We study the problem of fair -committee selection under an egalitarian objective. Given agents partitioned into groups (\eg, demographic quotas), the goal is to aggregat…
Towards Human-AI Complementarity in Matching Tasks
Adrian Arnaiz-Rodriguez, Nina Corvelo Benz, Suhas Thejaswi +2
Data-driven algorithmic matching systems promise to help human decision makers make better matching decisions in a wide variety of high-stakes application domains, such as healthca…
Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
Ameet Gadekar, Suhas Thejaswi
Capacitated fair-range -clustering generalizes classical -clustering by incorporating both capacity constraints and demographic fairness. In this setting, each facility has a…
Finding path motifs in large temporal graphs using algebraic fingerprints
Suhas Thejaswi, Aristides Gionis, Juho Lauri
We study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multiset of colors as a query, we sear…