Algorithmic fairness datasets: the story so far

A Fabris, S Messina, G Silvello, GA Susto - Data Mining and Knowledge …, 2022 - Springer
Data-driven algorithms are studied and deployed in diverse domains to support critical
decisions, directly impacting people's well-being. As a result, a growing community of …

Tackling documentation debt: a survey on algorithmic fairness datasets

A Fabris, S Messina, G Silvello, GA Susto - Proceedings of the 2nd ACM …, 2022 - dl.acm.org
A growing community of researchers has been investigating the equity of algorithms,
advancing the understanding of risks and opportunities of automated decision-making for …

Fair stable matching meets correlated preferences

A Brilliantova, H Hosseini - arXiv preprint arXiv:2201.12484, 2022 - arxiv.org
The stable matching problem sets the economic foundation of several practical applications
ranging from school choice and medical residency to ridesharing and refugee placement. It …

Mining Path Association Rules in Large Property Graphs (with Appendix)

Y Sasaki, P Karras - arXiv preprint arXiv:2408.02029, 2024 - arxiv.org
How can we mine frequent path regularities from a graph with edge labels and vertex
attributes? The task of association rule mining successfully discovers regular patterns in item …

k-Best Egalitarian Stable Marriages for Task Assignment

S Wu, LH U, P Karras - Proceedings of the VLDB Endowment, 2023 - dl.acm.org
In a two-sided market with each agent ranking individuals on the other side according to
their preferences, such as location or incentive, the stable marriage problem calls to find a …

Deferred acceptance with compensation chains

P Dworczak - Proceedings of the 2016 ACM Conference on …, 2016 - dl.acm.org
I introduce a class of algorithms called Deferred Acceptance with Compensation Chains
(DACC). DACC algorithms generalize the DA algorithms by Gale and Shapley [1962] by …

Fair procedures for fair stable marriage outcomes

N Tziavelis, I Giannakopoulos, RQ Johansen… - Proceedings of the …, 2020 - ojs.aaai.org
Given a two-sided market where each agent ranks those on the other side by preference, the
stable marriage problem calls for finding a perfect matching such that no pair of agents …

Mining Path Association Rules in Large Property Graphs

Y Sasaki, P Karras - Proceedings of the 33rd ACM International …, 2024 - dl.acm.org
How can we mine frequent path regularities from a graph with edge labels and vertex
attributes? The task of association rule mining successfully discovers regular patterns in item …

How to Avoid Jumping to Conclusions: Measuring the Robustness of Outstanding Facts in Knowledge Graphs

H Xiao, Y Li, Y Wang, P Karras, K Mouratidis… - Proceedings of the 30th …, 2024 - dl.acm.org
An outstanding fact (OF) is a striking claim by which some entities stand out from their peers
on some attribute. OFs serve data journalism, fact checking, and recommendation. However …

The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations

M Knittel, S Dooley, JP Dickerson - arXiv preprint arXiv:2202.11095, 2022 - arxiv.org
While the stable marriage problem and its variants model a vast range of matching markets,
they fail to capture complex agent relationships, such as the affiliation of applicants and …