Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual
Online bipartite-matching platforms are ubiquitous and find applications in important areas such as crowdsourcing and ridesharing. In the most general form, the platform consists of three entities: two sides to be matched and a platform operator that decides the matching. The design of algorithms for such platforms has traditionally focused on the operator's (expected) profit. Since fairness has become an important consideration that was ignored in the existing algorithms a collection of online matching algorithms have been developed that give a fair treatment guarantee for one side of the market at the expense of a drop in the operator's profit. In this paper, we generalize the existing work to offer fair treatment guarantees to both sides of the market simultaneously, at a calculated worst case drop to operator profit. We consider group and individual Rawlsian fairness criteria. Moreover, our algorithms have theoretical guarantees and have adjustable parameters that can be tuned as desired to balance the trade-off between the utilities of the three sides. We also derive hardness results that give clear upper bounds over the performance of any algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
FairnessVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
Two-sided matching markets have demonstrated significant impact in many real-world applications, including school choice, medical residency placement, electric vehicle charging, ride sharing, and recommender systems. How…
Recommendation SystemsBeyond Match Maximization and Fairness: Retention-Optimized Two-Sided Matching
On two-sided matching platforms such as online dating and recruiting, recommendation algorithms often aim to maximize the total number of matches. However, this objective creates an imbalance, where some users receive fa…
Rawlsian many-to-one matching with non-linear utility
We study a many-to-one matching problem, such as the college admission problem, where each college can admit multiple students. Unlike classical models, colleges evaluate sets of students through non-linear utility funct…
Operationalising Rawlsian Ethics for Fairness in Norm-Learning Agents
Social norms are standards of behaviour common in a society. However, when agents make decisions without considering how others are impacted, norms can emerge that lead to the subjugation of certain agents. We present RA…
Decision MakingEthicsFairnessFrom Utilitarian to Rawlsian Designs for Algorithmic Fairness
There is a lack of consensus within the literature as to how `fairness' of algorithmic systems can be measured, and different metrics can often be at odds. In this paper, we approach this task by drawing on the ethical f…
Fairness